Fast and compact regular expression matching

Theoretical Computer Science

Volumn 409, Issue 3, 2008, Pages 486-496

  Bille, Philip ^a   Farach Colton, Martin ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Approximate regular expression matching: String edit distance; Four russian technique; Regular expression matching; Subsequence indexing

Indexed keywords

ALPHABET SIZES; APPROXIMATE REGULAR EXPRESSION MATCHING: STRING EDIT DISTANCE; CONSTANT TIMES; FOUR RUSSIAN TECHNIQUE; RAM MODELS; REGULAR EXPRESSION MATCHING; REGULAR EXPRESSIONS; STRING EDIT DISTANCES; STRING MATCHING; SUBSEQUENCE INDEXING;

INDEXING (OF INFORMATION);

EID: 55949108676     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.08.042     Document Type: Article

References (32)

1. Arlazarov V.L., Dinic E.A., Kronrod M.A., and Faradzev I.A. On economic construction of the transitive closure of a directed graph. Dokl. Acad. Nauk 194 (1970) 487-488 (in Russian). English translation in Soviet Math. Dokl. 11, 1209-1210, 1975
2. Baeza-Yates R., and Gonnet G.H. A new approach to text searching. Commun. ACM 35 10 (1992) 74-82
3. Baeza-Yates R.A. Searching subsequences. Theor. Comput. Sci. 78 2 (1991) 363-376
4. Baeza-Yates R.A., and Gonnet G.H. Fast text searching for regular expressions or automaton searching on tries. J. ACM 43 6 (1996) 915-936
5. Baeza-Yates R.A., and Navarro G. Faster approximate string matching. Algorithmica 23 2 (1999) 127-158
6. D. Barbosa, A.O. Mendelzon, L. Libkin, L. Mignet, M. Arenas, Efficient incremental validation of XML documents, in: Proceedings of the 20th International Conference on Data Engineering, 2004, p. 671
7. P. Bille, New algorithms for regular expression matching, in: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, 2006, pp. 643-654
8. Crochemore M., Melichar B., and Troníček Z. Directed acyclic subsequence graph: Overview. J. Discrete Algorithms 1 3-4 (2003) 255-280
9. A. Golynski, J.I. Munro, S.S. Rao, Rank/select operations on large alphabets: A tool for text indexing, in: Proceedings of the 17th annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 368-373
10. D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge, 1997
11. Hagerup T., Miltersen P.B., and Pagh R. Deterministic dictionaries. J. Algorithms 41 1 (2001) 69-85
12. H. Hosoya, B. Pierce, Regular expression pattern matching for XML, in: Proceedings of the 28th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL, 2001, pp. 67-80
13. Q. Li, B. Moon, Indexing and querying XML data for regular path expressions, in: Proceedings of the 27th International Conference on Very Large Data Bases, VLDB, 2001, pp. 361-370
14. Masek W., and Paterson M. A faster algorithm for computing string edit distances. J. Comput. System Sci. 20 (1980) 18-31
15. Mehlhorn K., and Nähler S. Bounded ordered dictionaries in o (log log n) time and o (n) space. Inform. Process. Lett. 35 4 (1990) 183-189
16. M. Murata, Extended path expressions of XML, in: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS, 2001, pp. 126-137
17. Myers E.W. A four-russian algorithm for regular expression pattern matching. J. ACM 39 2 (1992) 430-448
18. Myers E.W., and Miller W. Approximate matching of regular expressions. Bull. Math. Biol. 51 (1989) 5-37
19. Myers G. A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM 46 3 (1999) 395-415
20. Navarro G. A guided tour to approximate string matching. ACM Comput. Surv. 33 1 (2001) 31-88
21. Navarro G. NR-grep: A fast and flexible pattern-matching tool. Software - Practice Experience 31 13 (2001) 1265-1312
22. Navarro G. Approximate regular expression searching with arbitrary integer weights. Nordic J. Comput. 11 4 (2004) 356-373
23. Navarro G., and Raffinot M. New techniques for regular expression searching. Algorithmica 41 2 (2004) 89-116
24. Stallman R.M. Emacs the extensible, customizable self-documenting display editor. SIGPLAN Not. 16 6 (1981) 147-156
25. Thompson K. Regular expression search algorithm. Commun. ACM 11 (1968) 419-422
26. M. Thorup, Space efficient dynamic stabbing with fast queries, in: Proceedings of the Symposium on Theory of Computing, STOC, 2003, pp. 649-658
27. van Emde Boas P. Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett. 6 3 (1977) 80-82
28. van Emde Boas P., Kaas R., and Zijlstra E. Design and implementation of an efficient priority queue. Mathematical Systems Theory 10 (1977) 99-127
29. Wagner R.A., and Fischer M.J. The string-to-string correction problem. J. ACM 21 1 (1974) 168-173
30. S. Wu, U. Manber, Agrep - a fast approximate pattern-matching tool, in: Proceedings USENIX Winter 1992 Technical Conference, San Francisco, CA, 1992, pp. 153-162
31. Wu S., and Manber U. Fast text searching: Allowing errors. Commun. ACM 35 10 (1992) 83-91
32. Wu S., Manber U., and Myers E.W. A subquadratic algorithm for approximate regular expression matching. J. Algorithms 19 3 (1995) 346-360