On the approximation ratio of LZ-end to LZ77
From MaRDI portal
Publication:2146133
DOI10.1007/978-3-030-86692-1_10OpenAlexW3204878438MaRDI QIDQ2146133FDOQ2146133
Authors: Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda 
Publication date: 15 June 2022
Full work available at URL: https://arxiv.org/abs/2106.01173
Cites Work
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Compression of individual sequences via variable-rate coding
- Automatic Sequences
- A universal algorithm for sequential data compression
- Title not available (Why is that?)
- Free differential calculus. IV: The quotient groups of the lower central series
- An optimal algorithm for computing the repetitions in a word
- Fast relative Lempel-Ziv self-index for similar sequences
- Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
- On compressing and indexing repetitive sequences
- The Smallest Grammar Problem
- Data compression via textual substitution
- Optimal-Time Dictionary-Compressed Indexes
- A faster grammar-based self-index
- LZ77-based self-indexing with faster pattern matching
- Crochemore Factorization of Sturmian and Other Infinite Words
- At the roots of dictionary compression: string attractors
- Title not available (Why is that?)
- Towards a definitive measure of repetitiveness
- LZ-End Parsing in Linear Time
- A separation between RLSLPs and LZ77
- Dynamic index and LZ factorization in compressed space
- Lempel-Ziv-like parsing in small space
- LZD factorization: simple and practical online grammar compression with variable-to-fixed encoding
- On the Approximation Ratio of Ordered Parsings
- On the size of overlapping Lempel-Ziv and Lyndon factorizations
Cited In (4)
Uses Software
This page was built for publication: On the approximation ratio of LZ-end to LZ77
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146133)
