Faster approximate string matching

Algorithmica (New York)

Volumn 23, Issue 2, 1999, Pages 127-158

  Baeza Yates, R ^a   Navarro, G ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Bit parallelism; Text searching allowing errors

Indexed keywords

EID: 0001114905     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/pl00009253     Document Type: Article

References (35)

1. A. Aho and M. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6): 333-340, June 1975.
2. R. Baeza-Yates. Text retrieval: theory and practice. In J. van Leeuwen, editor, Proc. 12th IFIP World Computer Congress, volume I: Algorithms, Software, Architecture, pages 465-476. Elsevier Science, Amsterdam, September 1992.
3. R. Baeza-Yates. A unified view of string matching algorithms. In K. Jeffery, J. Král, and M. Bartosek. editors, SOFSEM '96: Theory and Practice of Informatics, Milovy, Czech Republic, November 1996, LNCS 1175, pages 1-15. Springer-Verlag, Berlin, 1996. (Invited paper.)
4. R. Baeza-Yates and G. Gonnet. A new approach to text searching. Communications of the ACM, 35(10): 74-82, October 1992.
5. R. Baeza-Yates and G. Navarro. A fast heuristic for approximate string matching. In N. Ziviani, R. Baeza-Yates, and K. Guimarães, editors, Proc. WSP '96, pages 47-63. Carleton University Press, Ottawa, 1996. ftp//ftp.dcc.uchile.cl/pub/users/gnavarro/wsp96.2.ps.gz.
6. R. Baeza-Yates and G. Navarro. A faster algorithm for approximate string matching. In D. Hirschberg and G. Myers, editors, Proc. CPM '96, LNCS 1075, pages 1-23. Springer-Verlag, Berlin, 1996. ftp//-ftp.dec.uchile.cl/pub/users/gnavarro/cpm96.ps.gz.
7. R. Baeza-Yates and G. Navarro. Multiple approximate string matching. In Proc. WADS '97, LNCS 1272, pages 174-184. Springer-Verlag, Berlin, 1997. ftp//ftp.dcc.uchile.cl/pub/users/-gnavarro/wads97.ps.gz.
8. R. Baeza-Yates and C. Perleberg. Fast and practical approximate pattern matching. Information Processing Letters, 59:21-27, 1996.
9. W. Chang and J. Lampe. Theoretical and empirical comparisons of approximate string matching algorithms. In Proc. CPM '92, LNCS 644, pages 172-181. Springer-Verlag, Berlin, 1992.
10. W. Chang and E. Lawler. Sublinear approximate string matching and biological applications. Algorith-mica, 12(4/5):327-344, Oct./Nov. 1994.
11. W. Chang and T. Marr. Approximate string matching and local similarity. In Proc. CPM '94, LNCS 807, pages 259-273. Springer-Verlag, Berlin, 1994.
12. N. El-Mabrouk and F. Lisacek. Very fast identification of RNA motifs in genomic DNA. Application to tRNA search in yeast genome. Journal of Molecular Biology, 264, November 1996.
13. Z. Galil and K. Park. An improved algorithm for approximate string matching. SIAM Journal of Computing, 19(6):989-999, 1990.
14. P. Jokinen, J. Tarhio, and E. Ukkonen. A comparison of approximate string matching algorithms. Software Practice and Experience, 26( 12):1439-1458, 1996.
15. S. Kurtz. Fundamental Algorithms for a Declarative Pattern Matching System. Dissertation, Technische Fakultät, Universität Bielefeld, available as Report 95-03, July 1995.
16. G. Landau and U. Vishkin. Fast string matching with k differences. Journal of Computer Svstems Science, 37:63-78, 1988.
17. G. Landau and U. Vishkin. Fast parallel and serial approximate string matching. Journal of Algorithms, 10:157-169, 1989.
18. E. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4/5):345-374, Oct./Nov. 1994.
19. G. Navarro. Multiple approximate string matching by counting. In Proc. WSP '97, pages 125-139. Carleton University Press, Ottawa, 1997. ftp//ftp.dcc.uchile.cl/pub/users/gnavarro/wsp97.1.ps.gz.
20. G. Navarro. A partial deterministic automaton for approximate string matching. In Proc. WSP '97, pages 112-124. Carleton University Press, Ottawa, 1997. ftp//ftp.dcc.uchile.cl/pub/users/gnavarro/wsp97.2.ps.gz.
21. S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino acid sequences of two proteins. Journal of Molecular Biology, 48:444-453, 1970.
22. P. Sellers. The theory and computation of evolutionary distances: pattern recognition. Journal of Algorithms, 1:359-373, 1980.
23. F. Shi. Fast approximate string matching with q-blocks sequences. In N. Ziviani, R. Baeza-Yates, and K. Guimarãs, editors, Proc. WSP '96, pages 257-271. Carleton University Press, Ottawa, 1996.
24. D. Sunday. A very fast substring search algorithm. Communications of the ACM, 33(8):132-142, August 1990.
25. E. Sutinen and J. Tarhio. On using q-gram locations in approximate string matching. In P. Spirakis, editor, Proc. ESA '95, LNCS 979, pages 327-340. Springer-Verlag, Berlin, 1995.
26. T. Takaoka. Approximate pattern matching with samples. In Proc ISAAC '94, LNCS 834, pages 234-242. Springer-Verlag, Berlin, 1994.
27. J. Tarhio and E. Ukkonen. Boyer-Moore approach to approximate string matching. In J. Gilbert and R. Karlsson, editors, SWAT '90, LNCS 447, pages 348-359. Springer-Verlag, Berlin, 1990.
28. E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100-118, 1985.
29. E. Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, 6:132-137, 1985.
30. E. Ukkonen. Approximate string matching with q-grams and maximal matches. Theoretical Computer Science, 1:191-211, 1992.
31. B. Watson. The performance of single and multiple keyword pattern matching algorithms. In N. Ziviani, R. Baeza-Yates, and K. Guimarães, editors, Proc. WSP '96, pages 280-294. Carleton University Press, Ottawa, 1996.
32. A. Wright. Approximate string matching using within-word parallelism. Software Practice and Experience, 24(4):337-362, April 1994.
33. S. Wu and U. Manber. Agrep - a fast approximate pattern-matching tool. In Proc USENIX Technical Conference, pages 153-162, 1992.
34. S. Wu and U. Manber. Fast text searching allowing errors. Communications of the ACM, 35(10):83-91, October 1992.
35. S. Wu, U. Manber, and E. Myers. A subquadratic algorithm for approximate limited expression matching. Algorithmica, 15(1):50-67, 1996.