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.
@InProceedings{gawrychowski:LIPIcs.STACS.2012.624, author = {Gawrychowski, Pawel}, title = {{Tying up the loose ends in fully LZW-compressed pattern matching}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {624--635}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.624}, URN = {urn:nbn:de:0030-drops-33975}, doi = {10.4230/LIPIcs.STACS.2012.624}, annote = {Keywords: pattern matching, compression, Lempel-Ziv-Welch} }
Feedback for Dagstuhl Publishing