Fast and practical approximate string matching

Information Processing Letters

Volumn 59, Issue 1, 1996, Pages 21-27

  Baeza Yates, Ricardo A ^a   Perleberg, Chris H ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Algorithms; Approximate string matching

Indexed keywords

EID: 0042960934     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00083-X     Document Type: Article

References (33)

1. K. Abrahamson, Generalized string matching, SIAM J. Comput. 16 (1987) 1039-1051.
2. A.V. Aho and M. Corasick, Efficient string matching: An aid to bibliographic search, Comm. ACM 18 (1975) 333-340.
3. R. Baeza-Yates and G.H. Gonnet, A new approach to text searching, Comm. ACM 35 (1992) 74-82.
4. R. Baeza-Yates and G.H. Gonnet. Fast string matching with mismatches, Inform, and Comput. 108 (1994) 187-199.
5. R. Baeza-Yates and G. Navarro, A faster algorithm for approximate string matching, in: Proc. Combinatorial Pattern Matching (CPM'96), Irvine, CA (1996).
6. R. Baeza-Yates and M. Régnier, Fast two dimensional pattern matching, Inform. Process. Lett. 45 (1993) 51-57.
7. R.A. Baeza-Yates and C.H. Perleberg, Fast and practical approximate pattern matching, in: A. Apostolico, M. Crochemore, Z. Galil and U. Manber, eds., Combinatorial Pattern Matching, Tucson, AZ, Lecture Notes in Computer Science 644 (Springer, Berlin, 1992) 185-192.
8. W. Chang and J. Lampe, Theoretical and empirical comparisons of approximate string matching algorithms, in: A. Apostolico, M. Crochemore, Z Galil and U. Manber, eds., Combinatorial Pattern Matching, Tucson, AZ, Lecture Notes in Computer Science 644 (Springer, Berlin, 1992) 172-181.
9. W. Chang and E. Lawler, Approximated string matching in sublinear expected time, in: Proc. 31st Annual IEEE Symp. on Foundations of Computer Science, St. Louis, MO (1990) 116-124.
10. B. Commentz-Walter, A string matching algorithm fast on the average, in: ICALP, Lecture Notes in Computer Science 6 (Springer, Berlin, 1979) 118-132.
11. M. Fischer and M. Paterson, String matching and other products, in: R. Karp, ed., Complexity of Computation (SIAM-AMS Proceedings) 7 (American Mathematical Society, Providence, RI, 1974) 113-125.
12. Z. Galil and R. Giancarlo, Improved string matching with k mismatches, SIGACT News 17 (1986) 52-54.
13. Z. Galil and K. Park, An improved algorithm for approximate string matching, SIAM J. Comput. 19 (1990) 989-999.
14. G.H. Gonnet and R. Baeza-Yates, Handbook of Algorithms and Data Structures - In Pascal and C (Addison-Wesley, Wokingham, UK, 2nd ed., 1991).
15. R. Grossi and F. Luccio, Simple and efficient string matching with k mismatches, Inform. Process. Lett. 33 (1989) 113-120.
16. T. Hagerup, On saving space in parallel computation, Inform. Process. Lett. 29 (1988) 327-329.
17. A. Hume and D.M. Sunday, Fast string searching, Software - Practice and Experience 21 (1991) 1221-1248.
18. D.E. Knuth, J. Morris and V. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977) 323-350.
19. G. Landau and U. Vishkin, Efficient string matching with k mismatches, Theoret. Comput. Sci. 43 (1986) 239-249.
20. G. Landau and U. Vishkin, Fast string matching with k differences, J. Comput. System Sci. 37 (1988) 63-78.
21. U. Manber and S. Wu, An algorithm for approximate string matching with non uniform costs, Tech. Rept. TR-89-19, Dept. of Computer Science, University of Arizona, Tucson, AZ, 1989.
22. E.W. Myers, An O(ND) difference algorithm and its variants, Algorithmica 1 (1986) 251-266.
23. C. Perleberg, Three longest substring algorithms, J. Brazilian Comput. Soc. 1 (1995) 12-22.
24. P.D. Smith, Experiments with a very fast substring search algorithm, Software - Practice and Experience 21 (1991) 1065-1074.
25. M.A. Sridhar, Efficient algorithms for multiple pattern matching, Tech. Rept. Computer Sciences 661, University of Wisconsin-Madison, 1986.
26. D.M. Sunday, A very fast substring search algorithm, Comm. ACM 33 (1990) 132-142.
27. J. Tarhio and E. Ukkonen, Boyer-Moore approach to approximate string matching, in: J.R. Gilbert and R.G. Karlsson, eds., Proc. 2nd Scandinavian Workshop in Algorithmic Theory, SWAT'90, Bergen, Norway, Lecture Notes in Computer Science 447 (Springer, Berlin, 1990) 348-359.
28. E. Ukkonen, Finding approximate patterns in strings, J. Algorithms 6 (1985) 132-137.
29. E. Ukkonen and D. Wood, Approximate string matching with suffix automata, Algorithmica 10 (1993) 353-364.
30. S. Wu, Personal communication, 1992.
31. S. Wu and U. Manber, Agrep - A fast approximate pattern-matching tool, in: Proc. USENIX 1992 Winter Technical Conf., San Francisco, CA (1992) 153-162.
32. S. Wu and U. Manber, Fast text searching allowing errors, Comm. ACM 35 (1992) 83-91.
33. S. Wu, U. Manber and E. Myers, A sub-quadratic algorithm for approximate limited expression matching, Algorithmica 15 (1996) 50-67.