A comparison of index-based Lempel-Ziv LZ77 factorization algorithms

DOI10.1145/2379776.2379781MaRDI QIDQ2875093zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, W. F. Smyth, German Tischler, Munina Yusufu

Publication date 13 August 2014

Published in ACM Computing Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2379776.2379781

zbMATH Keywords

algorithmLempel-Ziv factorizationlongest common prefixperiodicitystringsuffix arraysuffix tree

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms on strings (68W32)

Recommendations

• Lazy Lempel-Ziv factorization algorithms
• Lempel-Ziv factorization: simple, fast, practical
• Lempel-Ziv Factorization Revisited
• Lempel-Ziv factorization using less time \& space
• Linear Time Lempel-Ziv Factorization: Simple, Fast, Small

Cited in

(10)

• A separation between RLSLPs and LZ77
• Computing regularities in strings: a survey
• Speeding up the detection of tandem repeats over the edit distance
• Lempel-Ziv Factorization Revisited
• Compression with the tudocomp framework
• Entropy lower bounds for dictionary compression
• Lempel-Ziv factorization: simple, fast, practical
• Lazy Lempel-Ziv factorization algorithms
• Maintaining the size of LZ77 on semi-dynamic strings
• A \textit{really} simple approximation of smallest grammar

This page was built for publication: A comparison of index-based Lempel-Ziv LZ77 factorization algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875093)