On the number of factors in the LZ-End factorization

DOI10.1007/978-3-031-43980-3_20MaRDI QIDQ6545432

Maria Kosche, Florin Manea, Paweł Gawrychowski

Publication date: 29 May 2024

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)

Cites Work

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

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)