Computing LZ78-Derivates with Suffix Trees

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...

Full description

Saved in:
Bibliographic Details
Published in:DCC (Los Alamitos, Calif.) pp. 133 - 142
Main Author: Koppl, Dominik
Format: Conference Proceeding
Language:English
Published: IEEE 19.03.2024
Subjects:
Data compression
Data structures
factorization algorithms
lossless data compression
substring compression
ISSN:2375-0359
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2375-0359
DOI:10.1109/DCC58796.2024.00021