Los puntos clave no están disponibles para este artículo en este momento.
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.
Dominik Köppl (Tue,) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: