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

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 1997
3377	Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de - Hopcroft, Ullman - 2004
2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
1927	Modern Information Retrieval - Baeza-Yates, Ribeiro-Neto - 1999
1923	Basic local alignment search tool - Altschul, Gish, et al. - 1990
996	A general method applicable to the search for similarities in the amino acid sequence of two proteins - Needleman, Wunsch - 1970
851	Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10: 707–710 - Levenshtein - 1966
773	Algorithms on Strings, Trees and Sequences - Gusfield - 1997
605	The Art of Computer Programming. Volume 3: Sorting and Searching - Knuth - 1998
546	Fast pattern matching in strings - Knuth, Morris, et al. - 1977
537	The String-to-String Correction Problem - Wagner, Fischer - 1974
493	A space-economical suffix tree construction algorithm - MCCREIGHT - 1976
487	A fast string searching algorithm - Boyer, Moore - 1977
449	M.J.: Efficient string matching: An aid to bibliographic search - Aho, Corasick - 1975
380	pattern matching algorithms - Weiner, Linear - 1973
325	Time warps, string edits, and macromolecules: the theory and practice of sequence comparison - Sankoff, Kruskal - 1983
315	Text Algorithms - Crochemore, Rytter - 1994
294	Techniques for automatically correcting words in text - Kukich - 1992
288	Fast Text Searching Allowing Errors - Wu, Manber
285	Fast algorithms for finding nearest common ancestors - Harel, Tarjan - 1984
234	Introduction to computational biology - Waterman - 1995
212	The theory and computation of evolutionary distances: pattern recognition - Sellers - 1980
200	A new approach to text searching - Baeza-Yates, Gonnet - 1992
179	Accessibility of Information on the Web - Lawrence - 1999
178	GLIMPSE: A tool to search through entire file systems - Manber, Wu - 1994
161	On finding lowest common ancestors: simplification and parallelization - Schieber, Vishkin - 1988
156	A technique for computer detection and correction of spelling errors - Damerau - 1964
144	A faster algorithm for computing string edit distances - Masek, Paterson - 1980
136	Finding approximate patterns in strings - Ukkonen - 1985
133	An o(ND) difference algorithm and its variations - Myers - 1986
130	Approximate string-matching with q-grams and maximal matches, Theoretical Computer Science 92 - Ukkonen - 1992
121	A fast bit-vector algorithm for approximate string matching based on dynamic programming - Myers - 1999
119	Approximate string matching - Hall, Dowling - 1980
115	Agrep-a fast approximate patternmatching tool - Wu, Manber - 1992
110	The myriad virtues of subword trees - Apostolico - 1985
101	The string to string correction problem - Wagner, Fisher - 1974
98	Fast parallel and serial approximate string matching - Landau, Vishkin - 1989
98	A very fast substring search algorithm - Sunday - 1990
94	Practical fast searching in strings - Horspool - 1980
89	A sublinear algorithm for approximate keyword searching - Myers - 1994
88	The smallest automaton recognizing the subwords of a text - Blumer, Blumer, et al. - 1985
83	Speeding up two string matching algorithms - Crochemore, Czumaj, et al. - 1994
82	Transductions and repetitions - Crochemore - 1986
76	Binary Codes Capable of Correcting Spurious Insertions and Deletions of Ones - Levenshtein - 1965
75	An improved algorithm for approximate string matching - Galil, Park - 1990
70	A string matching algorithm fast on average - Commentz-Walter - 1979
69	Faster approximate string matching - Baeza-Yates, Navarro - 1999
69	The string-to-string correction problem with block move - Tichy - 1984
64	Two algorithms for approximate string matching in static texts - Jokinen, Ukkonen - 1991
61	PATRICIA-Practical Algorithm To Retrieve Information Coded in Alphanumeric - Morrison - 1968