Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
From regular expressions to deterministic automata
Theoretical Computer Science
A Four Russians algorithm for regular expression pattern matching
Journal of the ACM (JACM)
Fast text searching: allowing errors
Communications of the ACM
A subquadratic algorithm for approximate regular expression matching
Journal of Algorithms
Programming Techniques: Regular expression search algorithm
Communications of the ACM
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
NR-grep: a fast and flexible pattern-matching tool
Software—Practice & Experience
Fast and compact regular expression matching
Theoretical Computer Science
Significant subpatterns matching
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Hi-index | 0.00 |
We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/logk s), where s is the amount of main memory that can be allocated. The algorithm permits arbitrary integer weights and matches the complexity of the best previous techniques, but it is simpler and faster in practice. In our way, we define a new recurrence for approximate searching where the current values depend only on previous values. Interestingly, our algorithm turns out to be a relevant option also for simple approximate string matching with arbitrary integer weights.