New algorithms for regular expression matching

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

Volumn 4051 LNCS, Issue , 2006, Pages 643-654

  Bille, Philip ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; COSTS; RANDOM ACCESS STORAGE; STANDARDS; TEXT PROCESSING;

EXPRESSION MATCHING; REGULAR EXPRESSION MATCHING; STRINGS; WORD LENGTH;

PROBLEM SOLVING;

EID: 33746378193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_56     Document Type: Conference Paper

References (8)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: principles, techniques, and tools. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1986.
2. R. Baeza-Yates and G. H. Gonnet. A new approach to text searching. Commun. ACM, 35(10):74-82, 1992.
3. P. Bille and M. Farach-Colton. Fast and compact regular expression matching, 2005. Submitted to ajournal. Preprint availiable at arxiv.org/cs/0509069.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, second edition. MIT Press, 2001.
5. T. Hagerup, P. B. Miltersen, and R. Pagh. Deterministic dictionaries. J. of Algorithms, 41(1):69-85, 2001.
6. E. W. Myers. A four-russian algorithm for regular expression pattern matching. J. of the ACM, 39(2):430-448, 1992.
7. G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM, 46(3):395-415, 1999.
8. K. Thompson. Regular expression search algorithm. Comm. of the ACM, 11:419-422, 1968.