Lazy Lempel-Ziv Factorization Algorithms
From MaRDI portal
Publication:5266607
DOI10.1145/2699876zbMath1365.68505OpenAlexW2537851465WikidataQ125386730 ScholiaQ125386730MaRDI QIDQ5266607
Simon J. Puglisi, Juha Kärkkäinen, Dominik Kempa
Publication date: 16 June 2017
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2699876
data compressionBurrows-Wheeler transformsuffix arraystring processingLempel-Ziv factorizationLempel-Ziv parsingLZ77
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Related Items (3)
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries ⋮ LZ77 ⋮ LCP Array Construction in External Memory
Cites Work
- On compressing and indexing repetitive sequences
- Linear-time computation of local periods
- Lempel-Ziv factorization using less time \& space
- Computing longest previous factor in linear time and applications
- Finding approximate repetitions under Hamming distance.
- Practical compressed suffix trees
- Linear time algorithms for finding and representing all the tandem repeats in a string
- A comparison of index-based lempel-Ziv LZ77 factorization algorithms
- Indexing Highly Repetitive Collections
- A Faster Grammar-Based Self-index
- Compressed representations of sequences and full-text indexes
- Hybrid indexes for repetitive datasets
- Lempel-Ziv Factorization Revisited
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Faster Approximate Pattern Matching in Compressed Repetitive Texts
- An analysis of the Burrows—Wheeler transform
- Linear work suffix array construction
- An Online Algorithm for Finding the Longest Previous Factors
- Indexing compressed text
- The Smallest Grammar Problem
- Medium-Space Algorithms for Inverse BWT
- Permuted Longest-Common-Prefix Array
- LPF Computation Revisited
- A universal algorithm for sequential data compression
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- A Linear-Time Algorithm for Seeds Computation
- Lempel-Ziv Factorization: Simple, Fast, Practical
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
This page was built for publication: Lazy Lempel-Ziv Factorization Algorithms
