Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts

Authors:
Philip Bille;Rolf Fagerberg;Inge Li Gørtz
Affiliations:
IT University of Copenhagen, Denmark;University of Southern Denmark, Odense M, Denmark;Technical University of Denmark, Lyngby, Denmark
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2009

Citing 17
Cited 2

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Fast parallel and serial approximate string matching

Journal of Algorithms
A Four Russians algorithm for regular expression pattern matching

Journal of the ACM (JACM)
Two-dimensional periodicity and its applications

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Dynamic Perfect Hashing: Upper and Lower Bounds

SIAM Journal on Computing
Let sleeping files lie: pattern matching in Z-compressed files

Journal of Computer and System Sciences
Programming Techniques: Regular expression search algorithm

Communications of the ACM
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Approximate String Matching: A Simpler Faster Algorithm

SIAM Journal on Computing
Bit-Parallel Approach to Approximate String Matching in Compressed Texts

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Multiple Pattern Matching in LZW Compressed Text

DCC '98 Proceedings of the Conference on Data Compression
Faster Approximate String Matching over Compressed Text

DCC '01 Proceedings of the Data Compression Conference
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

SIAM Journal on Computing
Regular expression searching on compressed text

Journal of Discrete Algorithms
Approximate string matching on Ziv-Lempel compressed text

Journal of Discrete Algorithms
A Technique for High-Performance Data Compression

Computer
New algorithms for regular expression matching

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

Random access to grammar-compressed strings

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient LZ78 factorization of grammar compressed text

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known complexities for both problems. In particular, we significantly improve the space bounds, which in practical applications are likely to be a bottleneck.