Optimal LZ-end parsing is hard

DOI10.4230/LIPICS.CPM.2023.3MaRDI QIDQ6622005

Kazuhisa Seto, Kazuhiro Kurita, Hideo Bannai, Mitsuru Funakoshi, Takeaki Uno, Yuto Nakashima

Publication date: 21 October 2024

zbMATH Keywords

data compressionrepetitiveness measuresLZ-end

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (2)

New advances in rightmost Lempel-Ziv ⋮ On the number of factors in the LZ-End factorization

This page was built for publication: Optimal LZ-end parsing is hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622005)