Autor:	Köppl, Dominik
Rok vydání:	2024
Předmět:	Computer Science - Data Structures and Algorithms
Zdroj:	full version of conference paper published at DCC 2024
Druh dokumentu:	Working Paper
DOI:	10.1109/DCC58796.2024.00021
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2409.14649 Zobrazit plný text záznamu View this record from Arxiv