Lempel-Ziv-like parsing in small space
From MaRDI portal
Publication:2205632
DOI10.1007/s00453-020-00722-6zbMath1460.68038arXiv1903.01909OpenAlexW3030118813MaRDI QIDQ2205632
Gonzalo Navarro, Dmitry Kosolobov, Simon J. Puglisi, Daniel Valenzuela
Publication date: 21 October 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.01909
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Online timestamped text indexing
- LZ77 computation based on the run-length encoded BWT
- Large alphabets and incompressibility
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Analyzing relative Lempel-Ziv reference construction
- On the approximation ratio of Lempel-Ziv parsing
- Faster suffix sorting
- On the Bit-Complexity of Lempel--Ziv Compression
- Indexing Highly Repetitive Collections
- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
- An analysis of the Burrows—Wheeler transform
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Space-Conscious Compression
- Data compression via textual substitution
- Universal codeword sets and representations of the integers
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
- Range Predecessor and Lempel-Ziv Parsing
- Performance of LZ algorithms on individual sequences
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Lempel-Ziv Compression in a Sliding Window
- LZ-End Parsing in Linear Time
- Online LZ77 Parsing and Matching Statistics with RLBWTs
- Most Recent Match Queries in On-Line Suffix Trees
- RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy
- At the roots of dictionary compression: string attractors
This page was built for publication: Lempel-Ziv-like parsing in small space
