Tying up the loose ends in fully LZW-compressed pattern matching
Data Structures and Algorithms
2011-09-20 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1109.4034,
title = {Tying up the loose ends in fully LZW-compressed pattern matching},
author = {Pawel Gawrychowski},
journal= {arXiv preprint arXiv:1109.4034},
year = {2011}
}
Comments
submitted