Optimal Pattern Matching in LZW Compressed Strings

DOI10.1145/2483699.2483705zbMath1301.68283OpenAlexW2140687800MaRDI QIDQ2933655

Paweł Gawrychowski

Publication date: 5 December 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2483699.2483705

zbMATH Keywords

compressionpattern matchingLempel-Ziv-Welch

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Randomized algorithms (68W20) Algorithms on strings (68W32)

Related Items (5)

Unnamed Item ⋮ Simple and efficient LZW-compressed multiple pattern matching ⋮ Streaming pattern matching with \(d\) wildcards ⋮ Periodicity in data streams with wildcards ⋮ A Space-Optimal Grammar Compression.

This page was built for publication: Optimal Pattern Matching in LZW Compressed Strings