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

8131	Introduction to algorithms - Cormen, Leiserson, et al. - 2001
3692	Introduction to Automata Theory, Languages and Computation - Hopcroft, Ullman - 1979
3521	Basic local alignment search tool - �Altschul, Gish, et al. - 1990
2378	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
2213	Modern information retrieval - Baeza-Yates, Ribeiro-Neto
1304	A general method applicable to the search for similarities in the amino acid sequence of two proteins - Needleman, Wunsch - 1970
1073	Binary codes capable of correcting deletions, insertions and reversals - Levenshtein - 1966
852	Algorithms on Strings, Trees, and Sequences - Gusfield - 1997
658	The Art of Computer Programming, Volume 3: Sorting and Searching - Knuth - 1973
622	The string-to-string correction problem - Wagner, Fisher - 1974
604	Fast pattern matching in strings - Knuth, Morris, et al. - 1977
548	A fast string searching algorithm - Boyer, Moore - 1977
525	A space-economical suffix tree construction algorithm 23 (2 - McCreight - 1976
499	Efficient string matching: an aid to bibliographic search - Aho, Corasick - 1975
411	pattern matching algorithm, in - Weiner, Linear - 1973
357	Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison - Sankoff, Kruskal
338	Techniques for Automatically Correcting Words in Text - Kukich - 1992
325	Text algorithms - Crochemore, Rytter - 1994
316	Tarjan, “Fast algorithms for finding nearest common ancestors - Harel, E - 1984
305	Fast Text Searching: Allowing Errors - Wu, Manber - 1992
254	Introduction to Computational Biology - Waterman - 1995
224	The theory and computation of evolutionary distances: pattern recognition - Sellers - 1980
214	A new approach to text searching - Baeza-yates, Gonnet - 1992
189	A technique for computer detection and correction of spelling errors - Damerau - 1964
188	Accessibility of information on the web - Lawrence, Giles
185	GLIMPSE: A Tool to Search through Entire File Systems - Manber, Wu - 1994
175	On finding lowest common ancestors: Simplification and parallelization - Schieber, Vishkin - 1988
159	A faster algorithm computing string edit distances - Masek, Paterson - 1980
148	An O (ND) difference algorithm and its variations - Myers - 1986
144	Approximate string matching with q-grams and maximal matches - Ukkonen - 1992
142	Finding Approximate patterns in strings - Ukkonen - 1985
131	A fast bit-vector algorithm for approximate pattern matching based on dynamic programming - Myers - 1998
127	Approximate string matching - Hall, Dowling - 1980
126	Agrep—A fast approximate patternmatching tool - Wu, Manber - 1992
114	The myriad virtues of subword trees - Apostolico - 1985
113	The string to string correction problem - Wagner, Fisher - 1974
105	Fast parallel and serial approximate string matching - Landau, Vishkin - 1989
105	A very fast substring search algorithm - Sunday - 1990
101	Practical fast searching in strings - Horspool - 1980
93	The smallest automaton recognizing the subwords of a text - Blumer, Blumer, et al. - 1985
91	A sublinear algorithm for approximate keywords searching - MYERS - 1994
89	Speeding up two string-matching algorithms. Algorithmica - Crochemore, Czumaj, et al. - 1994
83	Transducers and repetitions - Crochemore - 1986
81	Binary codes capable of correcting spurious insertions and reversals - Levenshtein - 1965
80	A string matching algorithm fast on the average - Commentz-Walter - 1979
74	An improved algorithm for approximate string matching - GALIL, PARK - 1990
72	The String-to-String Correction Problem with Block Moves - Tichy - 1984
71	Faster approximate string matching - Baeza-Yates, Navarro - 1999
70	Patricia—practical algorithm to retrieve information coded in alphanumeric - MORRISON - 1968
66	Two algorithms for approximate string matching in static texts - Jokinen, Ukkonen - 1991