Fast and Flexible String Matching by Combining Bit-parallelism and Suffix Automata

ACM Journal of Experimental Algorithmics

Volumn 5, Issue , 2000, Pages 4-

  Navarro, Gonzalo ^a   Raffinot, Mathieu ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84901634402     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/351827.384246     Document Type: Article

References (35)

1. Abeahamson, K. 1987. Generalized string matching. SJAM Journal on Computing 16, 6, 1039-1051.
2. Baeza-Yates, R. 1992. Text retrieval: Theory and practice. In 12th IFIP World Computer Congress, Volume I (Sept. 1992), pp. 465-476. Elsevier Science.
3. Baeza-Yates, R. and Gonnet, G. 1992. A new approach to text searching. CACM 35, 10 (Oct.), 74-82.
4. Baeza-Yates, R. and Gonnet, G. 1994. Fast string matching with mismatches. Information and Computation 108, 2, 187-199.
5. Baeza-Yates, R. and Navaeeo, G. 1999. Faster approximate string matching. Algorithmica 23, 2, 127-158.
6. Baeza-Yates, R. and Peeleberg, C. 1992. Fast and practical approximate pattern matching. In Proc. CPM’92 (1992), pp. 185-192. Springer-Verlag. LNCS 644.
7. Blumer, A., Ehrenfeucht, A., and Haussler, D. 1989. Average sizes of suffix trees and dawgs. Discrete Applied Mathematics 24, 1, 37-45.
8. Boyee, R. S. and Mooee, J. S. 1977. A fast string searching algorithm. Commun. ACM 20, 10, 762-772.
9. Ceochemoee, M. 1986. Transducers and repetitions. Theoretical Computer Science 45, 1, 63-86.
10. Ceochemoee, M., Czumaj, A., Gasieniec, L., Jaeominek, S., Leceoq, T., Plandowski, W., and Ryttee, W. 1993. Fast practical multi-pattern matching. Rapport 93-3, Institut Gaspard Monge, Université de Marne la Vallée.
11. Ceochemoee, M. and Ryttee, W. 1994. Text algorithms. Oxford University Press.
12. Czumaj, A., Ceochemore, M., Gasieniec, L., Jaeominek, S., Leceoq, T., Plandowski, W., and Rytter, W. 1994. Speeding up two string-matching algorithms. Algorithmica 12, 247-267.
13. El-Mabrouk, N. and Ceochemoee, M. 1996. Boyer-Moore strategy to efficient approximate string matching. In Proc. of CPM’96, Number 1075 in Lecture Notes in Computer Science (1996), pp. 24-38. Springer-Verlag, Berlin.
14. Fischee, M. J. and Pateeson, M. 1974. String matching and other products. In R. M. Kaep Ed., Proceedings SJAM-AMS Complexity of Computation (Providence, RI, 1974), pp. 113-125.
15. Horspool, R. N. 1980. Practical fast searching in strings. Software Practice and Experience 10, 501-506.
16. Jokinen, P., Taehio, J., and Ukkonen, E. 1996. A Comparison of approximate string matching algorithms. Software Practice and Experience 26, 12, 1439-1458.
17. Knuth, D. E., Moeeis, J. H., and Peatt, V. R. 1977. Fast pattern matching in strings. SIAM Journal on Computing 6, 1, 323-350.
18. Leceoq, T. 1992. Recherches de mot. Ph. D. thesis, Université d’Orléans, France.
19. Myers, G. 1999. A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal o] the ACM 46, 3, 395-415.
20. Navaero, G. 1997. A partial deterministic automaton for approximate string matching. In Proc. of WSP’97 (1997), pp. 112-124. Garleton University Press.
21. Navaero, G. 1998. Approximate Text Searching. Ph. D. thesis. Department of Computer Science, University of Ghile. Tech. Report TR/DGG-98-14. ftp://ftp.dcc.uchile.cl/-pub/users/gnavarro/thesisQS.ps.gz.
22. Navaero, G. 2000a. A guided tour to approximate string matching. ACM Computing Surveys. To appear.
23. Navaero, G. 2000b. Nrgrep: a fast and flexible pattern matching tool. Technical Report TR/DGG-2000-3 (Aug.), Dept. of Computer Science, Univ. of Chile, ftp://ftp.dec.uchile.cl/pub/users/gnavarro/nrgrep.ps.gz.
24. Navaero, G. and Baeza-Yates, R. 1999. Very fast and simple approximate string matching. Information Processing Letters 72, 65-70.
25. Navaero, G. and Raffinot, M. 1998. A bit-parallel approach to suffix automata: Fast extended string matching. In Proc. CPM’98, LNCS v. 1448 (1998), pp. 14-33. Springer-Verlag.
26. Navaero, G. and Raffinot, M. 1999. Fast regular expression search. In J. Vitter and C. Zaeoliagis Eds., Proceedings of the 3rd Workshop on Algorithm Engineering, Number 1668 in Lecture Notes in Computer Science (1999), pp. 199-213. Springer-Verlag, Berlin.
27. Navaero, G. and Raffinot, M. 2000. Fast and simple character classes and bounded gaps pattern matching, with application to protein searching. In ACM RECOMB 2001 (2000). To appear.
28. Pinter, R. Y. 1985. Efflcient string matching with don’t care pattern. In A. Apostolico and Z. Galil Eds., Combinatorial Algorithms on Words, pp. 11-29. Springer-Verlag, Berlin.
29. Raffinot, M. 1997a. Asymptotic estimation of the average number of terminal states in dawgs. In Proc. WSP’97 (1997), pp. 140-148. Garieton University Press.
30. Raffinot, M. 1997b. On the multi backward dawg matching algorithm (MultiBDM). In Proc. WSP’97 (1997), pp. 149-165. Garieton University Press.
31. Sunday, D. 1990. A very fast substring search algorithm. CACM 33, 8 (Aug.), 132-142.
32. Taehio, J. and Ukkonen, E. 1993. Approximate Boyer-Moore string matching. SIAM J. on Computing 22, 2, 243-260.
33. Wu, S. and Manber, U. 1992. Fast text searching allowing errors. CACM 35, 10 (Oct.), 83-91.
34. Wu, S., Manbee, U., and Myees, E. 1996. A sub-quadratic algorithm for approximate limited expression matching. Algorithmica 15, 1, 50-67.
35. Yao, A. 1979. The complexity of pattern matching for a random string. SIAM J. on Computing 8, 368-387.