Article View: comp.theory
Article #2012Approx. string matching
From: Peter O'Leary
Date: Thu, 11 Jan 1990 15:55
Date: Thu, 11 Jan 1990 15:55
8 lines
841 bytes
841 bytes
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.
Technical Details
Message-ID:
<9001092236.aa13533@PARIS.ICS.UCI.EDU>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!zaphod.mps.ohio-state.edu!swrinde!ucsd!ucbvax!BONNIE.ICS.UCI.EDU!peteShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!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