Pattern matching

Journal of Applied Statistics

Volumn 31, Issue 8, 2004, Pages 925-949

  Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Approximate string matching; Automata; Back tracking; Bit parallelism; Regular expressions; Suffix trees and arrays

Indexed keywords

EID: 8744236152     PISSN: 02664763     EISSN: None     Source Type: Journal    
DOI: 10.1080/0266476042000270527     Document Type: Article

References (33)

1. Aho, A., Sethi, R. & Ullman, J. (1986) Compilers - Principles, Techniques and Tools (Reading, MA: Addison-Wesley).
2. Baeza-Yates, R. & Gonnet, G. (1992) A new approach to text searching, Communications of the ACM, 35(10), pp. 74-82.
3. Baeza-Yates, R. & Gonnet, G. (1996) Fast text searching for regular expressions or automaton searching on tries, Journal of the ACM, 43(6), pp. 915-936.
4. Baeza-Yates, R. & Navarro, G. (1999) Faster approximate string matching, Algorithmica, 23(2), pp. 127-158.
5. Cormen, T., Leiserson, C. & Rivest, R. (1990) Introduction to Algorithms (Cambridge, MA: MIT Press).
6. Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecrocq, T., Plandowski, W. & Rytter, W. (1994) Speeding up two string matching algorithms, Algorithmica, 12(4/5), pp. 247-267.
7. Crochemore, M. & Rytter, W. (1994) Text Algorithms (Oxford: Oxford University Press).
8. Glushkov, V.-M. (1961) The abstract theory of automata, Russian Mathematical Surveys, 16, pp. 1-53.
9. Guimaraes, K., Oliva, P. & Myers, G. (1998) Reporting exact and approximate regular expression matches, in: Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching (CPM'98), LNCS 1448, pp. 91-103.
10. Gusfield, D. (1997) Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology (Cambridge: Cambridge University Press).
11. Hofmann, K., Bucher, P., Falquet, L. & Bairoch, A. (1999) The PROSITE database, its status in 1999, Nucleic Acids Research, 27, pp. 215-219.
12. Manber, U. & Myers, G. (1993) Suffix arrays: a new method for on-line string searches, SIAM Journal on Computing, 22(5), pp. 935-948.
13. McCreight, E. (1976) A space-economical suffix tree construction algorithm, Journal of Algorithms, 23(2), pp. 262-272.
14. Myers, G. (1992) A four russians algorithm for regular expression pattern matching, Journal of the ACM, 39(2); 430-448.
15. Myers, G. (1995) Approximately matching context-free languages, Information Processing Letters, 54(2), pp. 85-92.
16. Myers, G. (1999) A fast bit-vector algorithm for approximate string matching based on dynamic programming, Journal of the ACM, 46(3), pp. 395-415.
17. Myers, G. & Miller, W. (1989) Approximate matching of regular expressions, Bulletin of Mathematical Biology, 51, pp. 7-37.
18. Navarro, G. (2001a) A guided tour to approximate string matching, ACM Computing Surveys, 33(1), pp.31-88.
19. Navarro, G. (2001b) NR-grep: a fast and flexible pattern matching tool, Software Practice and Experience (SPE), 31, pp. 1265-1312.
20. Navarro, G. & Baeza-Yates, R. (2000) A hybrid indexing method for approximate string matching, Journal of Discrete Algorithms, 1(1), pp. 205-239.
21. Navarro, G. & Raffinot, M. (2000a) Fast regular expression search, in: Proceedings of the 3rd Workshop on Algorithm Engineering LNCS 1668, pp. 199-213. (Extended version to appear in Algorithmica.)
22. Navarro, G. & Raffinot, M. (2000b) Fast and flexible string matching by combining bit-parallelism and suffix automata, ACM Journal of Experimental Algorithmics, 5(4).
23. Navarro, G. & Raffinot, M. (2001) Compact DFA representation for fast regular expression search, in: Proceedings of the 5th Workshop on Algorithm Engineering (WAE'01), LNCS 2141, pp. 1-12.
24. Navarro, G. & Raffinot, M. (2002) Flexible Pattern Matching in Strings - Practical on-line search algorithms for texts and biological sequences (Cambridge: Cambridge University Press).
25. Navarro, G. & Raffinot, M. (2003) Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching, Journal of Computational Biology, 10(6), pp. 903-923.
26. Sellers, P. (1980) The theory and computation of evolutionary distances: pattern recognition, Journal of Algorithms, 1, pp. 359-373.
27. Setubal, J. & Meidanis, J. (1997) Introduction to Computational Molecular Biology (Boston, MA: PWS Publishing Company).
28. Thompson, K. (1968) Regular expression search algorithm, Communications of the ACM, 11, pp. 419-422.
29. Ukkonen, E. (1985) Finding approximate patterns in strings, Journal of Algorithms, 6(1-3), pp. 132-137.
30. Watson, B. (1996) A new regular grammar pattern matching algorithm, in: Proceedings of the 4th Annual European Symposium, LNCS 1136, pp. 364-377.
31. Wu, S. & Manber, U. (1992) Fast text searching allowing errors, Communications of the ACM, 35(10), pp. 83-91.
32. Wu, S., Manber, U. & Myers, G. (1995) A subquadratic algorithm for approximate regular expression matching, Journal of Algorithms, 19(3), pp. 346-360.
33. Yao, A. (1979) The Complexity of pattern matching for a random string, SIAM Journal on Computing, 8(3), pp. 368-387.