On the Size of Lempel-Ziv and Lyndon Factorizations
arXiv:1611.08898 · doi:10.4230/LIPIcs.STACS.2017.45
Abstract
Lyndon factorization and Lempel-Ziv (LZ) factorization are both important tools for analysing the structure and complexity of strings, but their combinatorial structure is very different. In this paper, we establish the first direct connection between the two by showing that while the Lyndon factorization can be bigger than the non-overlapping LZ factorization (which we demonstrate by describing a new, non-trivial family of strings) it is never more than twice the size.
12 pages
Cited by in corpus (5)
- Inverse Lyndon words and Inverse Lyndon factorizations of words
- Optimal Construction of Compressed Indexes for Highly Repetitive Texts
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words
- On repetitiveness measures of Thue-Morse words
- On the approximation ratio of LZ-End to LZ77