A Separation Between Run-Length SLPs and LZ77
Data Structures and Algorithms
2017-11-21 v1
Abstract
In this paper we give an infinite family of strings for which the length of the Lempel-Ziv'77 parse is a factor Ω(logn/loglogn) smaller than the smallest run-length grammar.
Cite
@article{arxiv.1711.07270,
title = {A Separation Between Run-Length SLPs and LZ77},
author = {Philip Bille and Travis Gagie and Inge Li Gørtz and Nicola Prezza},
journal= {arXiv preprint arXiv:1711.07270},
year = {2017}
}
Related papers
View all related →
Data Structures and Algorithms · Computer Science
Range Predecessor and Lempel-Ziv Parsing
Djamal Belazzougui, Simon J. Puglisi
2015-07-28
Data Structures and Algorithms · Computer Science
Lempel-Ziv (LZ77) Factorization in Sublinear Time
Dominik Kempa, Tomasz Kociumaka
2025-06-19
Discrete Mathematics · Computer Science
Relations Between Greedy and Bit-Optimal LZ77 Encodings
Dmitry Kosolobov
2018-01-10
Data Structures and Algorithms · Computer Science
Lempel-Ziv Factorization May Be Harder Than Computing All Runs
Dmitry Kosolobov
2014-09-22
Data Structures and Algorithms · Computer Science
On the approximation ratio of LZ-End to LZ77
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima +2
2021-08-17
Data Structures and Algorithms · Computer Science
A really simple approximation of smallest grammar
Artur Jeż
2014-03-19
Data Structures and Algorithms · Computer Science
Faster Lightweight Lempel-Ziv Parsing
Dmitry Kosolobov
2015-06-09
Data Structures and Algorithms · Computer Science
Space Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets
Keisuke Goto, Hideo Bannai
2013-10-08
Data Structures and Algorithms · Computer Science
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2020-12-11
Data Structures and Algorithms · Computer Science
Simpler and Faster Lempel Ziv Factorization
Keisuke Goto, Hideo Bannai
2013-01-21
Information Theory · Computer Science
Comparison of LZ77-type Parsings
Dmitry Kosolobov, Arseny M. Shur
2018-05-24
Data Structures and Algorithms · Computer Science
On the Size of Lempel-Ziv and Lyndon Factorizations
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi +1
2020-12-08
Data Structures and Algorithms · Computer Science
Lightweight Lempel-Ziv Parsing
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2020-12-11
Data Structures and Algorithms · Computer Science
Faster Compact On-Line Lempel-Ziv Factorization
Jun'ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga +1
2013-05-28
Data Structures and Algorithms · Computer Science
Lempel-Ziv Computation In Compressed Space (LZ-CICS)
Dominik Köppl, Kunihiko Sadakane
2016-05-31
Data Structures and Algorithms · Computer Science
Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding
Jun'ichi Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2015-03-20
Data Structures and Algorithms · Computer Science
Decompressing Lempel-Ziv Compressed Text
Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz +1
2019-11-05
Data Structures and Algorithms · Computer Science
Computing Lempel-Ziv Factorization Online
Tatiana Starikovskaya
2012-12-03
Data Structures and Algorithms · Computer Science
Lempel-Ziv Parsing in External Memory
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2020-12-11
Data Structures and Algorithms · Computer Science
Lempel Ziv Computation In Small Space (LZ-CISS)
Johannes Fischer, Tomohiro I, Dominik Köppl
2015-04-13
Data Structures and Algorithms · Computer Science
Computing the LZ-End parsing: Easy to implement and practically efficient
Patrick Dinklage
2024-09-18
Chaotic Dynamics · Physics
Properties of maximum Lempel-Ziv complexity strings
C. A. J. Nunes, E. Estevez-Rams, B. Aragón Fernández, R. Lora Serrano
2013-11-05
Data Structures and Algorithms · Computer Science
Sublinear Algorithms for Approximating String Compressibility
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith
2007-06-11
Data Structures and Algorithms · Computer Science
A Normal Sequence Compressed by PPM$^*$ but not by Lempel-Ziv 78
Liam Jordon, Philippe Moser
2021-01-21
Data Structures and Algorithms · Computer Science
A fast and simple $O (z \log n)$-space index for finding approximately longest common substrings
Nick Fagan, Jorge Hermo González, Travis Gagie
2022-12-06