Decompressing Lempel-Ziv Compressed Text
Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li G{\o}rtz,, Nicola Prezza

TL;DR
This paper presents new algorithms for decompressing Lempel-Ziv 77 compressed text efficiently, achieving near-optimal space and time complexities, and improves pattern matching on compressed data.
Contribution
It introduces algorithms that decompress LZ77 compressed text in linear time with minimal working space, surpassing previous folklore solutions, especially for general alphabets.
Findings
Achieves $O(n)$ time and $O(z)$ space for constant alphabets.
Provides a trade-off between time and space for large alphabets.
Improves pattern matching efficiency on LZ77-compressed text.
Abstract
We consider the problem of decompressing the Lempel--Ziv 77 representation of a string of length using a working space as close as possible to the size of the input. The folklore solution for the problem runs in time but requires random access to the whole decompressed text. Another folklore solution is to convert LZ77 into a grammar of size and then stream in linear time. In this paper, we show that time and working space can be achieved for constant-size alphabets. On general alphabets of size , we describe (i) a trade-off achieving time and space for any , and (ii) a solution achieving time and space. The latter solution, in particular, dominates both folklore algorithms for the problem. Our solutions can, more generally,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · DNA and Biological Computing · Network Packet Processing and Optimization
