New techniques for regular expression searching

Algorithmica (New York)

Volumn 41, Issue 2, 2004, Pages 89-116

  Navarro, Gonzalo ^a   Raffinot, Mathieu ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b CNRS Lab Génome Informatique   (France)

Author keywords

BDM; Bit parallelism; Compact DFA representation; Glushkov automaton; Reverse factors

Indexed keywords

CODES (SYMBOLS); COMPUTER SOFTWARE; COSTS; FINITE AUTOMATA;

BDM; BIT-PARALLELISM; COMPACT DFA REPRESENTATION; GLUSHKOV AUTOMATON; REVERSE FACTORS;

ALGORITHMS;

EID: 10844251024     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1120-3     Document Type: Article

References (30)

1. A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, MA, 1985.
2. A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6):333-340, 1975.
3. R. Baeza-Yates and G. Gonnet. A new approach to text searching. Communications of the ACM, 35(10):74-82, 1992.
4. G. Berry and R. Sethi. From regular expression to deterministic automata. Theoretical Computer Science, 48(1): 117-126, 1986.
5. A. Brüggemann-Klein. Regular expressions into finite automata. Theoretical Computer Science, 120(2): 197-213, 1993.
6. J.-M. Champarnaud. Subset construction complexity for homogeneous automata, position automata and ZPC-structures. Theoretical Computer Science, 267:17-34, 2001.
7. J.-M. Champarnaud and F. Coulon. NFA reduction algorithms by means of regular inequalities. In Proceedings of DLT 2003, LNCS 2710, pages 194-205. Springer-Verlag, Berlin, 2003.
8. C.-H. Chang and R. Paige. From regular expression to DFAs using NFAs. In Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching (CPM), LNCS 664, pages 90-110. Spring-Verlag, Berlin, 1992.
9. B. Commente-Walter. A string matching algorithm fast on the average. In Proceedings of the 6th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 6, pages 118-132. Springer-Verlag, Berlin, 1979.
10. M. Crochemore, A. Czumaj, L. Gasieniec, S. Jarominek, T. Lecroq, W. Plandowski, and W. Rytter. Fast practical multi-pattern matching. Rapport 93-3, Institut Gaspard Monge, Université de Marne la Vallée, 1993.
11. A. Czumaj, M. Crochemore, L. Gasieniec, S. Jarominek, Thierry Lecroq, W. Plandowski, and W. Rytter. Speeding up two string-matching algorithms. Algorithmica, 12:247-267, 1994.
12. V.-M. Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16:1-53, 1961.
13. K. Hofmann, P. Bucher, L. Falquet, and A. Bairoch. The PROSITE database, its status in 1999. Nucleic Acids Research, 27:215-219, 1999.
14. L. Ilie, G. Navarro, and S. Yu. On NFA reductions. In Theory is Forever (Salomaa Festschrift), LNCS 3113, pages 112-124. Springer-Verlag, Berlin, 2004.
15. L. Ilie and S. Yu. Reducing NFAs by invariant equivalences. Theoretical Computer Science, 306:373-390, 2003.
16. D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(1):323-350, 1977.
17. T. Lecroq. Experimental results on string matching algorithms. Software Practice and Experience, 25(7):727-765, 1995.
18. M. Mohri. String matching with automata. Nordic Journal of Computing, 4(2):217-231, 1997.
19. E. Myers. A four-Russian algorithm for regular expression pattern matching. Journal of the ACM, 39(2):430-448, 1992.
20. G. Navarro. NR-grep: a fast and flexible pattern matching tool. Software Practice and Experience (SPE), 31:1265-1312, 2001.
21. G. Navarro and M. Raffinot. Fast regular expression search. In Proceedings of the 3rd Workshop on Algorithm Engineering (WAE '99), LNCS 1668, pages 199-213. Springer-Verlag, Berlin, 1999.
22. G. Navarro and M. Raffinot. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA), 5(4), 2000. http://www.jea.acm.org/2000/NavarroString.
23. G. Navarro and M. Raffinot. Compact DFA representation for fast regular expression search. In Proceedings of the 5th Workshop on Algorithm Engineering (WAE '01), LNCS 2141, pages 1-12. Springer-Verlag, Berlin, 2001.
24. G. Navarro and M. Raffinot. Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching. Journal of Computational Biology, 10(6):903-923, 2003. Earlier version in Proceedings of RECOMB 2001.
25. M. Raffinot. On the multi-backward dawg matching algorithm (MultiBDM). In Proceedings of the 4th South American Workshop on String Processing (WSP), pages 149-165. Carleton University Press, Ottawa, 1997.
26. K. Thompson. Regular expression search algorithm. Communications of the ACM, 11(6):419-422, 1968.
27. B. Watson. Taxonomies and Toolkits of Regular Language Algorithms. Ph. D. dissertation, Eindhoven University of Technology, 1995.
28. S. Wu and U. Manber. Agrep - a fast approximate pattern-matching tool. In Proceedings of the USENIX Technical Conference, pages 153-162, 1992.
29. S. Wu and U. Manber. Fast text searching allowing errors. Communications of the ACM, 35(10):83-91, 1992.
30. A. Yao. The complexity of pattern matching for a random string. SIAM Journal on Computing, 8:368-387, 1979.