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

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

2006-09-15

arxiv.org/abs/cs/0609085v2

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-410720