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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:DCC (Los Alamitos, Calif.) s. 133 - 142
Hlavný autor: Koppl, Dominik
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 19.03.2024
Predmet:
Data compression
Data structures
factorization algorithms
lossless data compression
substring compression
ISSN:2375-0359
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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