LZ77
From MaRDI portal
Software:44675
No author found.
Related Items (19)
Comparison of LZ77-type parsings ⋮ On the approximation ratio of LZ-end to LZ77 ⋮ Can formal languages help pangenomics to represent and analyze multiple genomes? ⋮ A \textit{really} simple approximation of smallest grammar ⋮ Lempel-Ziv-like parsing in small space ⋮ Generalized substring compression ⋮ Fixed block compression boosting in FM-indexes: theory and practice ⋮ Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries ⋮ On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties ⋮ Linear Time Lempel-Ziv Factorization: Simple, Fast, Small ⋮ LZ77 computation based on the run-length encoded BWT ⋮ Lempel-Ziv factorization powered by space efficient suffix trees ⋮ Inverse Lyndon words and inverse Lyndon factorizations of words ⋮ Refining the \(r\)-index ⋮ Lempel-Ziv Factorization: Simple, Fast, Practical ⋮ Bicriteria Data Compression ⋮ LZ-End Parsing in Linear Time ⋮ Unnamed Item ⋮ Lyndon factorization of grammar compressed texts revisited
This page was built for software: LZ77
