Fast and compact regular expression matching

Authors:
Philip Bille;Martin Farach-Colton
Affiliations:
IT University of Copenhagen, 2300 Copenhagen S, Denmark;Department of Computer Science, Rutgers University, Piscataway, NJ 08855, USA
Venue:
Theoretical Computer Science
Year:
2008

Citing 24
Cited 10

Bounded ordered dictionaries in O(loglogN) time and O(n) space

Information Processing Letters
Searching subsequences

Theoretical Computer Science
A Four Russians algorithm for regular expression pattern matching

Journal of the ACM (JACM)
A new approach to text searching

Communications of the ACM
Fast text searching: allowing errors

Communications of the ACM
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)
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A fast bit-vector algorithm for approximate string matching based on dynamic programming

Journal of the ACM (JACM)
The String-to-String Correction Problem

Journal of the ACM (JACM)
Regular expression pattern matching for XML

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming Techniques: Regular expression search algorithm

Communications of the ACM
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Extended path expressions of XML

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deterministic dictionaries

Journal of Algorithms
NR-grep: a fast and flexible pattern-matching tool

Software—Practice & Experience
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
Space efficient dynamic stabbing with fast queries

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
EMACS the extensible, customizable self-documenting display editor

Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
Directed acyclic subsequence graph: overview

Journal of Discrete Algorithms
Efficient Incremental Validation of XML Documents

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Approximate regular expression searching with arbitrary integer weights

Nordic Journal of Computing
Rank/select operations on large alphabets: a tool for text indexing

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
New algorithms for regular expression matching

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Faster Regular Expression Matching

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Regular expression matching with multi-strings and intervals

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The Computational Hardness of Estimating Edit Distance

SIAM Journal on Computing
Polylogarithmic approximation for edit distance and the asymmetric query complexity

Property testing
Polylogarithmic approximation for edit distance and the asymmetric query complexity

Property testing
Towards approximate matching in compressed strings: local subsequence recognition

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Approximate regular expression matching with multi-strings

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Fast and cache-oblivious dynamic programming with local dependencies

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
The smoothed complexity of edit distance

ACM Transactions on Algorithms (TALG)
Approximate regular expression matching with multi-strings

Journal of Discrete Algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how to improve the space and/or remove a dependency on the alphabet size for each problem using either an improved tabulation technique of an existing algorithm or by combining known algorithms in a new way.