Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!zaphod.mps.ohio-state.edu!swrinde!ucsd!ucbvax!BONNIE.ICS.UCI.EDU!pete
From: pete@BONNIE.ICS.UCI.EDU (Peter O'Leary)
Newsgroups: comp.theory
Subject: Approx. string matching
Message-ID: <9001092236.aa13533@PARIS.ICS.UCI.EDU>
Date: 11 Jan 90 15:55:18 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: Peter O'Leary <pete%BONNIE.ICS.UCI.EDU@VM1.NoDak.EDU>
Lines: 8

I am attempting to find an efficient approximate string matching
algorithm and so far have had a frustrating time.  I have an paper
by Landau and Vishkin from a 1986 ACM Proceedings that describes an
O(kn) algorithm, however, the paper refers to other works that I have not
been able to locate.  Does anyone know of a good survey paper or textbook
with a good treatment of this subject?

Peter O'Leary.