Approximate string matching: A simpler faster algorithm

SIAM Journal on Computing

Volumn 31, Issue 6, 2002, Pages 1761-1782

  Cole, Richard ^a   Hariharan, Ramesh ^b  

^a NEW YORK UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Algorithms; Edit distance; String matching

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; GRAPH THEORY; MATRIX ALGEBRA; PATTERN MATCHING; TEXT PROCESSING; THEOREM PROVING;

EDIT DISTANCE; STRING MATCHING;

DYNAMIC PROGRAMMING;

EID: 0036767341     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700370527     Document Type: Article

References (13)

1. A. V. Aho and M. J. Corasick, Efficient string matching: An aid to bibliographic search, Comm. ACM, 18 (1975), pp. 333-340.
2. R. Baeza-Yates and G. Navarro, A faster algorithm for approximate string matching, in Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 1075. Springer-Verlag, Berlin, 1996, pp. 1-23.
3. W. I. Chang and E. Lawler, Approximate string matching in sublinear expected time, in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1990, pp. 116-125.
4. M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, New York, 1994, pp. 27-31.
5. M. Farach, Optimal suffix tree construction with large alphabets, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1997, pp. 137-143.
6. Z. Galil and R. Giancarlo, Data structures and algorithm for approximate string matching, J. Complexity, 4 (1988), pp. 33-72.
7. Z. Galil and K. Park, An improved algorithm for approximate string matching, SIAM J. Comput., 19 (1990), pp. 989-999.
8. G. Landau and U. Vishkin, Efficient string matching in the presence of errors, in Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1985, pp. 126-136.
9. G. Landau and U. Vishkin, Introducing efficient parallelism into approximate string matching and a new serial algorithm, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing, ACM, New York, 1986, pp. 220-230.
10. G. Landau and U. Vishkin, Fast string matching with k differences, J. Comput. System Sci., 37 (1988), pp. 63-78.
11. G. Landau and U. Vishkin, Fast parallel and serial approximate string matching, J. Algorithms, 10 (1989), pp. 158-169.
12. S. Sahinalp and U. Vishkin, Approximate Pattern Matching Using Locally Consistent Parsing, manuscript. Abstract appeared in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, Burlington, VT, IEEE Computer Society, Los Alamitos, CA, 1996, pp. 320-328.
13. B. Schieber and U. Viskin, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput., 17 (1988), pp. 1253-1262.