New and Faster Filters for Multiple Approximate String Matching

Random Structures and Algorithms

Volumn 20, Issue 1, 2002, Pages 23-49

  Baeza Yates, Ricardo ^a   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Multipattern search; Search allowing errors; String matching

Indexed keywords

EID: 0036111957     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10014     Document Type: Article

References (35)

1. A. Aho and M. Corasick, Efficient string matching: an aid to bibliographic search, CACM 18 (1975), 333-340.
2. R. Baeza-Yates, Efficient text searching, Ph.D. thesis, Department of Computer Science, University of Waterloo, May 1989 (Also as Research Report CS-89-17).
3. R. Baeza-Yates, Text retrieval: Theory and practice, Proc 12th IFIP World Computer Congress, Vol. I, Elsevier Science, Amsterdam, 1992, pp. 465-476.
4. R. Baeza-Yates and G. Gonnet, A new approach to text searching, CACM 35 (1992), 74-82.
5. R. Baeza-Yates and G. Navarro, Multiple approximate string matching, Proc WADS'97, LNCS 1272, 1997, pp. 174-184.
6. R. Baeza-Yates and G. Navarro, Faster approximate string matching, Algorithmica 23 (1999), 127-158.
7. R. Baeza-Yates and C. Perleberg, Fast and practical approximate pattern matching, Proc CPM'92, LNCS 644, 1992, pp. 185-192.
8. R.S. Boyer and J.S. Moore, A fast string searching algorithm, CACM 20 (1977), 762-772.
9. W. Chang and J. Lampe, Theoretical and empirical comparisons of approximate string matching algorithms, Proc CPM'92, LNCS 644, 1992, pp. 172-181.
10. W. Chang and E. Lawler, Sublinear approximate string matching and biological applications, Algorithmica 12 (1994), 327-344.
11. Z. Galil and K. Park, An improved algorithm for approximate string matching, SIAM J Comput 19 (1990), 989-999.
12. D. Greene, M. Parnas, and F. Yao, Multi-index hashing for information retrieval, Proc FOCS'94, 1994, pp. 722-731.
13. R. Grossi and F. Luccio, Simple and efficient string matching with k mismatches, Inform Process Lett 33 (1989), 113-120.
14. P. Jokinen, J. Tarhio, and E. Ukkonen, A comparison of approximate string matching algorithms, Software Practice and Experience 26 (1996), 1439-1458.
15. D.E. Knuth, J.H. Morris, Jr, and V.R. Pratt, Fast pattern matching in strings, SIAM J Comput 6 (1977), 323-350.
16. G. Landau and U. Vishkin, Fast parallel and serial approximate string matching, J Algorithms 10 (1989), 157-169.
17. R. Muth and U. Manber, Approximate multiple string search, Proc CPM'96, LNCS 1075, 1996, pp. 75-86.
18. E. Myers, A sublinear algorithm for approximate keyword searching, Algorithmica 12 (1994), 345-374.
19. G. Myers, A fast bit-vector algorithm for approximate pattern matching based on dynamic progamming, Proc CPM'98, LNCS 1448, 1998, pp. 1-13.
20. G. Navarro, Multiple approximate string matching by counting, Proc WSP'97, Carleton University Press, 1997, pp. 125-139.
21. G. Navarro, Approximate text searching, Ph.D. thesis, Department of Computer Science, University of Chile, December 1988 (ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/thesis98.ps.gz. Also as Tech. Report TR/DCC-98-14).
22. G. Navarro, A guided tour to approximate string matching, ACM Computing Surveys 33 (2001), 31-88.
23. G. Navarro and R. Baeza-Yates, Improving an algorithm for approximate pattern matching, Algorithmica 30 (2001), 473-502.
24. G. Navarro and R. Baeza-Yates, Very fast and simple approximate string matching, Inform. Process Lett 72 (1999), 65-70.
25. G. Navarro and M. Raffinot, A bit-parallel approach to suffix automata: Fast extended string matching, Proc CPM'98, LNCS 1448, 1998, pp. 14-33.
26. P. Sellers, The theory and computation of evolutionary distances: pattern recognition, J Algorithms 1 (1980), 359-373.
27. D. Sunday, A very fast substring search algorithm, CACM 33 (1990), 132-142.
28. E. Sutinen and J. Tarhio, On using q-gram locations in approximate string matching, Proc ESA'95, LNCS 979, 1995, 327-340.
29. J. Tarhio and E. Ukkonen, Approximate Boyer-Moore string matching, SIAM J Comput 22 (1993), 243-260.
30. E. Ukkonen, Algorithms for approximate string matching, Inform Control 64 (1985), 100-118.
31. E. Ukkonen, Finding approximate patterns in strings, J Alg 6 (1985), 132-137.
32. E. Ukkonen, Approximate string matching with q-grams and maximal matches, Theor Comput Sci 1 (1992), 191-211.
33. A. Wright, Approximate string matching using within-word parallelism, Software Practice and Experience 24 (1994), 337-362.
34. S. Wu and U. Manber, Fast text searching allowing errors, CACM 35 (1992), 83-91.
35. S. Wu, U. Manber, and E. Myers, A sub-quadratic algorithm for approximate limited expression matching, Algorithmica 15 (1996), 50-67.