Tying up the loose ends in fully LZW-compressed pattern matching

Details Tying up the loose ends in fully LZW-compressed pattern matching Tying up the loose ends in fully LZW-compressed pattern matching

2011-09-19

arxiv.org/abs/1109.4034v1

Computer Science

Data Structures and Algorithms

submitted

Scientific paper

We consider a natural generalization of the classical pattern matching problem: given compressed representations of a pattern p[1..M] and a text t[1..N] of sizes m and n, respectively, does p occur in t? We develop an optimal linear time solution for the case when both p and t are compressed using the LZW method. This improves the previously known O((n+m)log(n+m)) time solution of Gasieniec and Rytter, and essentially closes the line of research devoted to studying LZW-compressed exact pattern matching.

Affiliated with

Also associated with

No associations

Rating

Tying up the loose ends in fully LZW-compressed pattern matching 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 Tying up the loose ends in fully LZW-compressed pattern matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tying up the loose ends in fully LZW-compressed pattern matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96879