Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

TL;DR

This paper introduces improved algorithms for approximate string and regular expression matching on Ziv-Lempel compressed texts, offering better time and space efficiency, especially reducing space requirements for practical applications.

Contribution

It presents new algorithms that improve upon existing methods by optimizing both time and space complexity for pattern matching on compressed texts.

Findings

Enhanced algorithms with better time complexity

Significant reduction in space usage

Practical improvements for large-scale compressed text processing

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.