Lempel-Ziv Factorization Revisited

DOI10.1007/978-3-642-21458-5_4zbMath1339.68335OpenAlexW12238007MaRDI QIDQ3011840

Simon Gog, Enno Ohlebusch

Publication date: 29 June 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_4

Mathematics Subject Classification ID

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

Related Items

Faster Lightweight Lempel-Ziv Parsing, A \textit{really} simple approximation of smallest grammar, LZ77 computation based on the run-length encoded BWT, Refining the \(r\)-index, Lazy Lempel-Ziv Factorization Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Replacing suffix trees with enhanced suffix arrays
• Lempel-Ziv factorization using less time \& space
• Computing longest previous factor in linear time and applications
• Linear time algorithms for finding and representing all the tandem repeats in a string
• A comparison of index-based lempel-Ziv LZ77 factorization algorithms
• An Online Algorithm for Finding the Longest Previous Factors
• Permuted Longest-Common-Prefix Array
• LPF Computation Revisited
• Linear Algorithm for Data Compression via String Matching