On the approximation ratio of LZ-end to LZ77
From MaRDI portal
Publication:2146133
DOI10.1007/978-3-030-86692-1_10OpenAlexW3204878438MaRDI QIDQ2146133
Yuto Nakashima, Mitsuru Funakoshi, Masayuki Takeda, Takuya Mieno, Takumi Ideue, Shunsuke Inenaga
Publication date: 15 June 2022
Full work available at URL: https://arxiv.org/abs/2106.01173
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On compressing and indexing repetitive sequences
- An optimal algorithm for computing the repetitions in a word
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- A separation between RLSLPs and LZ77
- Towards a definitive measure of repetitiveness
- Lempel-Ziv-like parsing in small space
- Dynamic index and LZ factorization in compressed space
- Fast relative Lempel-Ziv self-index for similar sequences
- A Faster Grammar-Based Self-index
- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding
- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
- The Smallest Grammar Problem
- Data compression via textual substitution
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Automatic Sequences
- On the Approximation Ratio of Ordered Parsings
- Optimal-Time Dictionary-Compressed Indexes
- On the size of overlapping Lempel-Ziv and Lyndon factorizations
- LZ-End Parsing in Linear Time
- At the roots of dictionary compression: string attractors
- LZ77-Based Self-indexing with Faster Pattern Matching
- Crochemore Factorization of Sturmian and Other Infinite Words
- Free differential calculus. IV: The quotient groups of the lower central series
This page was built for publication: On the approximation ratio of LZ-end to LZ77
