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ženo v:

Podrobná bibliografie
Vydáno v:	DCC (Los Alamitos, Calif.) s. 133 - 142
Hlavní autor:	Koppl, Dominik
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 19.03.2024
Témata:	Data compression Data structures factorization algorithms lossless data compression substring compression
ISSN:	2375-0359
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

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