Fast regular expression search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1668, Issue , 1999, Pages 198-212

  Navarro, Gonzalo ^a   Raffinot, Mathieu ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b Université de Marne la Vallée   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTER RECOGNITION;

REGULAR EXPRESSION SEARCH; REGULAR EXPRESSIONS; STRING MATCHING;

PATTERN MATCHING;

EID: 84957099462     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48318-7_17     Document Type: Conference Paper

References (20)

1. A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 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. CACM, 35(10):74–82, October 1992.
4. G. Berry and R. Sethi. From regular expression to deterministic automata. Theor. Comput. Sci., 48(1):117–126, 1986.
5. A. Brüggemann-Klein. Regular expressions into finite automata. Theoretical Computer Science, 120(2):197–213, November 1993.
6. C.-H. Chang and R. Paige. From regular expression to DFA’s using NFA’s. In Proc. of the CPM’92, number 664 in LNCS, pages 90–110. Springer-Verlag, 1992.
7. B. Commentz-Walter. A string matching algorithm fast on the average. In Proc. ICALP’79, number 6 in LNCS, pages 118–132. Springer-Verlag, 1979.
8. 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.
9. A. Czumaj, Maxime Crochemore, L. Gasieniec, S. Jarominek, Thierry Lecroq, W. Plandowski, and W. Rytter. Speeding up two string-matching algorithms. Algorithmica, 12:247–267, 1994.
10. Juraj Hromkovië, Sebastian Seibert, and Thomas Wilke. Translating regular expression into small E-free nondeterministic automata. In STACS 97, LNCS, pages 55–66. Springer-Verlag, 1997.
11. D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(1):323–350, 1977.
12. T. Lecroq. Experimental results on string matching algorithms. Softw. Pract. Exp., 25(7):727–765, 1995.
13. E. Myers. A four-russian algorithm for regular expression pattern matching. J. of the ACM, 39(2):430–448, 1992.
14. G. Navarro and M. Raffinot. A bit-parallel approach to suffix automata: Fast extended string matching. In Proc. CPM’98, LNCS v. 1448, pages 14–33, 1998.
15. Mathieu Raffinot. On the multi backward dawg matching algorithm (MultiBDM). In Proc. WSP’97, pages 149–165. Carleton University Press, 1997.
16. K. Thompson. Regular expression search algorithm. CACM, 11(6):419–422, 1968.
17. B. Watson. Taxonomies and Toolkits of Regular Language Algorithms. Phd. dissertation, Eindhoven University of Technology, The Netherlands, 1995.
18. S. Wu and U. Manber. Agrep – a fast approximate pattern-matching tool. In Proc. of USENIX Technical Conference, pages 153–162, 1992.
19. S. Wu and U. Manber. Fast text searching allowing errors. CACM, 35(10):83–91, October 1992.
20. A. Yao. The complexity of pattern matching for a random string. SIAM J. on Computing, 8:368–387, 1979.