Abstract

We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to compare the performance of the different algorithms and show which are the best choices according to each case. We conclude with some future work directions and open problems. 1

Citations

8540	Introduction to Algorithms - Cormen, Leiserson, et al. - 1990
3840	Introduction to Automata Theory, Languages, and Computation - Hopcroft, Ullman - 1979
3717	Basic Local Alignment Search Tool - Altschul, Gish, et al. - 1990
2443	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
2353	Modern Information Retrieval - Baeza-Yates, Ribiero-Neto - 1999
1394	A general method applicable to the search for similarities in the amino acid sequence of two proteins - Needleman, Wunsch - 1970
1196	Binary codes capable of correcting deletions, insertions, and reversals - Levenshtein
900	Algorithms on Strings, Trees and Sequences - Gusfield - 1997
696	The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd Edition - Knuth - 1998
655	The string-to-string correction problem - Wagner, Fisher - 1974
629	Fast pattern matching in strings - Knuth, Morris, et al. - 1977
574	A fast string searching algorithm - Boyer, Moore - 1977
550	A space-economical suffix tree construction algorithm - McCreight - 1976
533	Efficient string matching: an aid to bibliographic search - Aho, Corasick - 1975
426	Linear pattern matching algorithms - Weiner - 1973
382	Time Warps, String Edits and Macromolecules - Sankoff, Kruskal - 1983
351	Techniques for automatically correcting words in text - Kukich - 1992
333	Fast algorithms for finding nearest common ancestors - Harel, Tarjan - 1984
331	Text algorithms - Crochemore, Rytter - 1994
317	Fast text searching allowing errors - Wu, Manber - 1992
264	Introduction to computational biology - Waterman - 1995
232	On the theory and computation of evolutionary distances - Sellers - 1974
227	A new approach to text searching - Baeza-Yates, Gonnet - 1992
204	A technique for computer detection and correction of spelling errors - Damerau - 1964
194	Accessibility of Information on the Web - Lawrence - 1999
188	GLIMPSE: a tool to search through entire file systems - Manber, Wu - 1994
184	On finding lowest common ancestors: simplifications and parallelizations - Schieber, Vishkin
169	A faster algorithm computing string edit distances - Masek, Paterson - 1980
155	An O(ND) difference algorithm and its variations - MYERS - 1986
151	Approximate string-matching with Q-GRAMS and maximal matchs. Theoretical Computer Science 92(1 - Ukkonen - 1992
146	Finding approximate patterns in strings - Ukkonen - 1985
137	A fast bit-vector algorithm for approximate string matching based on dynamic programming - Myers - 1999
132	Agrep--A fast approximate pattern-matching tool - Wu, Manber - 1992
131	Approximate String Matching - Hall, Dowling - 1980
119	The string to string correction problem - Wagner, Fisher - 1974
116	The myriad virtues of subword trees - Apostolico - 1985
111	Fast parallel and serial approximate string matching - LANDAU, VISHKIN - 1989
108	A very fast substring search algorithm - Sunday - 1990
105	Practical fast searching in strings - Horspool - 1980
102	The smallest automaton recognizing the subwords of a text. Theor - BLUMER, BLUMER, et al. - 1985
96	Speeding up two string-matching algorithms - CROCHEMORE, CZUMAJ, et al. - 1994
94	Transducers and repetitions - Crochemore - 1986
91	A sublinear algorithm for approximate keywords searching - Myers - 1994
86	Binary codes capable of correcting spurious insertions and deletions of ones - Levenshtein - 1965
84	A string matching algorithm fast on the average - Commentz-Walter - 1979
77	An improved algorithm for approximate string matching - Galil, Park - 1990
74	Patricia-practical algorithm to retrieve information coded in alphanumeric - Morrison - 1968
74	The string-to-string correction problem with block moves - Tichy - 1984
72	Faster approximate string matching - BAEZA-YATES, NAVARRO - 1999
66	Two algorithms for approximate string matching in static texts - Jokinen, Ukkonen - 1991