LZ77
From MaRDI portal
Software:44675
swMATH32964MaRDI QIDQ44675FDOQ44675
Author name not available (Why is that?)
Cited In (19)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- Bicriteria Data Compression
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
- 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
- Refining the \(r\)-index
- Can formal languages help pangenomics to represent and analyze multiple genomes?
- Title not available (Why is that?)
- On the approximation ratio of LZ-end to LZ77
- A \textit{really} simple approximation of smallest grammar
- Lempel-Ziv Factorization: Simple, Fast, Practical
- 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
