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

Pawel Gawrychowski

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 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 tudying LZW-compressed exact pattern matching.

Mots clés: pattern matching; compression; Lempel-Ziv-Welch

Domaines: Complexité [cs.CC]; Algorithme et structure de données [cs.DS]

Pawel Gawrychowski. Tying up the loose ends in fully LZW-compressed pattern matching. STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.624-635. ⟨hal-00678167⟩