Article View: comp.theory
Article #1728Re: Pattern matching: three problems
From: Ken Yousten
Date: Thu, 17 Dec 1992 02:37
Date: Thu, 17 Dec 1992 02:37
20 lines
1376 bytes
1376 bytes
In article <ByzqMv.9F@clss1.bangor.ac.uk> gerry@sees.bangor.ac.uk (Gerry Wolff) writes: >Here are three problems related to pattern matching. Solutions will >be gratefully received! You may want check out a recent comprehensive technical report surveying a wide variety of string matching problems. From what I've heard and read so far, this looks like a nice thorough piece of work. It mentions the theoretical work of Arratia and Waterman on string matching with i.i.d. random sequences, which may be relevant to your problems. The report can be obtained from princeton.edu (from what I remember it is in directory pub/graham) using anonymous ftp. Sorry I can't be of more direct help right now, but it seems likely that this report will be of more help to you than I would be anyway. -- Ken Yousten yousten@atlantis.cs.orst.edu
Technical Details
Message-ID:
<1gop63INNn2n@leela.CS.ORST.EDU>Path:
arc1-ca.pugleaf.net!sparky!uunet!ogicse!flop.ENGR.ORST.EDU!leela.CS.ORST.EDU!atlantis.CS.ORST.EDU!youstenReferences:
<ByzqMv.9F@clss1.bangor.ac.uk>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!ogicse!flop.ENGR.ORST.EDU!leela.CS.ORST.EDU!atlantis.CS.ORST.EDU!yousten From: yousten@atlantis.CS.ORST.EDU (Ken Yousten) Newsgroups: comp.theory Subject: Re: Pattern matching: three problems Message-ID: <1gop63INNn2n@leela.CS.ORST.EDU> Date: 17 Dec 92 02:37:54 GMT Article-I.D.: leela.1gop63INNn2n References: <ByzqMv.9F@clss1.bangor.ac.uk> Distribution: inet Organization: Computer Science Outreach Services - Oregon State University Lines: 20 NNTP-Posting-Host: atlantis.cs.orst.edu