Cited in
(30)- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- Lempel-Ziv factorization: simple, fast, practical
- Comparison of LZ77-type parsings
- Lempel-Ziv factorization powered by space efficient suffix trees
- LZ77 computation based on the run-length encoded BWT
- Lyndon factorization of grammar compressed texts revisited
- Lempel-Ziv-like parsing in small space
- BEETL
- vg
- dbwt
- DYNAMIC
- get-git-revisions
- Big-BWT
- r-index
- FRESCO
- Brotli
- libdivsufsort
- Zstandard
- Refining the \(r\)-index
- Can formal languages help pangenomics to represent and analyze multiple genomes?
- Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
- On the approximation ratio of LZ-end to LZ77
- scientific article; zbMATH DE number 6862137 (Why is no real title available?)
- Bicriteria data compression
- A \textit{really} simple approximation of smallest grammar
- Generalized substring compression
- Fixed block compression boosting in FM-indexes: theory and practice
- LZ-End Parsing in Linear Time
- Inverse Lyndon words and inverse Lyndon factorizations of words
This page was built for software: LZ77
