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

Abstract

Computing the LZ factorization (or LZ77 parsing) of a string is a computational bottleneck in many diverse applications, including data compression, text indexing, and pattern discovery. We describe new linear time LZ factorization algorithms, some of which require only 2n log n + O(log n) bits of working space to factorize a string of length n. These are the most space efficient linear time algorithms to date, using n log n bits less space than any previous linear time algorithm. The algorithms are also practical, simple to implement, and very fast in practice.

References in corpus (3)

• Lightweight Lempel-Ziv Parsing
• A Faster Grammar-Based Self-Index
• Faster Approximate Pattern Matching in Compressed Repetitive Texts

Cited by in corpus (8)

• Lightweight Lempel-Ziv Parsing
• Lempel-Ziv Parsing in External Memory
• Correlation lengths in the language of computable information
• Simpler and Faster Lempel Ziv Factorization
• Lempel-Ziv (LZ77) Factorization in Sublinear Time
• Deterministic sub-linear space LCE data structures with efficient construction
• Decompressing Lempel-Ziv Compressed Text
• Word Break on SLP-Compressed Texts