The following pages link to LZ77 (Q44675):
Displaying 20 items.
- (Q48669) (redirect page) (← links)
- LZ77 computation based on the run-length encoded BWT (Q724214) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Comparison of LZ77-type parsings (Q1621503) (← links)
- Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
- On the approximation ratio of LZ-end to LZ77 (Q2146133) (← links)
- Can formal languages help pangenomics to represent and analyze multiple genomes? (Q2163974) (← links)
- Lempel-Ziv-like parsing in small space (Q2205632) (← links)
- Refining the \(r\)-index (Q2297853) (← links)
- Generalized substring compression (Q2437745) (← links)
- (Q4636645) (← links)
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small (Q4928572) (← links)
- LZ-End Parsing in Linear Time (Q5111742) (← links)
- Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries (Q5150931) (← links)
- Lempel-Ziv Factorization: Simple, Fast, Practical (Q5232451) (← links)
- Bicriteria Data Compression (Q5242925) (← links)
