Linear Time Lempel-Ziv Factorization: Simple, Fast, Small

DOI10.1007/978-3-642-38905-4_19zbMath1381.68317arXiv1212.2952OpenAlexW1491366541MaRDI QIDQ4928572

Dominik Kempa, Juha Kärkkäinen, Simon J. Puglisi

Publication date: 14 June 2013

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.2952

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Related Items (11)

Lempel Ziv Computation in Small Space (LZ-CISS) ⋮ A \textit{really} simple approximation of smallest grammar ⋮ Lempel-Ziv-like parsing in small space ⋮ Generalized substring compression ⋮ Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries ⋮ LZ77 computation based on the run-length encoded BWT ⋮ Lempel-Ziv factorization powered by space efficient suffix trees ⋮ Bidirectional Text Compression in External Memory ⋮ LZ-End Parsing in Linear Time ⋮ Lazy Lempel-Ziv Factorization Algorithms ⋮ LCP Array Construction in External Memory

Uses Software

• LZ77

This page was built for publication: Linear Time Lempel-Ziv Factorization: Simple, Fast, Small