On the number of factors in the LZ-End factorization

DOI10.1007/978-3-031-43980-3_20MaRDI QIDQ6545432zbMATH OpenFDO

Authors Paweł Gawrychowski, Maria Kosche, Florin Manea

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43980-3_20

zbMATH Keywords

compressibilityLZ factorizationLZ-End factorization

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• An upper bound and linear-space queries on the LZ-End parsing
• scientific article; zbMATH DE number 6862137
• On the size of overlapping Lempel-Ziv and Lyndon factorizations
• New advances in rightmost Lempel-Ziv
• Lempel-Ziv factorization using less time \& space

Cites work

• A universal algorithm for sequential data compression
• An upper bound and linear-space queries on the LZ-End parsing
• Lempel-Ziv factorization: simple, fast, practical
• Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
• LZ-End Parsing in Linear Time
• On compressing and indexing repetitive sequences
• On the approximation ratio of LZ-end to LZ77
• Optimal LZ-end parsing is hard

Cited in

(4)

• An upper bound and linear-space queries on the LZ-End parsing
• Hardness and approximability of bounded access Lempel Ziv coding
• On the complexity and approximability of bounded access Lempel Ziv coding
• Smallest suffixient sets: effectiveness, resilience, and calculation

This page was built for publication: On the number of factors in the LZ-End factorization

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