Substring Compression Variations and LZ78-Derivates
Dominik K\"oppl
TL;DR
This paper introduces linear-time algorithms for computing various Lempel-Ziv factorizations and related substring compression methods, along with efficient data structures for these tasks, advancing the efficiency of compression algorithms.
Contribution
It presents the first linear-time algorithms for semi-greedy LZ78, LZD, and LZMW factorizations and develops data structures for substring compression in these contexts.
Findings
Linear-time algorithms for LZ78, LZD, LZMW factorizations
Linear-time data structures for substring compression
Results for lexparse and closed factorizations
Abstract
We propose algorithms computing the semi-greedy Lempel-Ziv 78 (LZ78), the Lempel-Ziv Double (LZD), and the Lempel-Ziv-Miller-Wegman (LZMW) factorizations in linear time for integer alphabets. For LZD and LZMW, we additionally propose data structures that can be constructed in linear time, which can solve the substring compression problems for these factorizations in time linear in the output size. For substring compression, we give results for lexparse and closed factorizations.
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.