Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
A Four Russians algorithm for regular expression pattern matching
Journal of the ACM (JACM)
A subquadratic algorithm for approximate regular expression matching
Journal of Algorithms
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM (JACM)
Pattern matching algorithms
Modern Information Retrieval
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A New Recognition Algorithm for Extended Regular Expressions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An effective algorithm for the membership problem for extended regular expressions
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
| Hi-index | 0.00 |
This paper addresses the extended regular expression matching problem: given an extended regular expression (a regular expression with intersection and complement) r of length m and a text string x = a1 ... an of length n, find all occurrences of substrings which match r. We will present a new bit-parallel pattern matching algorithm which runs in O((mn2 + ex(r)n3)/W) time and O((mn + ex(r)n2)/W) space, where ex(r) is the number of extended operators (intersection and complement) occurring in r, and W is word-length of a computer. In addition, we actually implement the proposed algorithm and evaluate the performance.