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

DOI10.1145/2379776.2379781zbMath1293.68312OpenAlexW2094392848WikidataQ61677864 ScholiaQ61677864MaRDI QIDQ2875093

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

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

algorithmperiodicitystringsuffix arraysuffix treelongest common prefixLempel-Ziv factorization

Mathematics Subject Classification ID

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

Related Items

A \textit{really} simple approximation of smallest grammar, Speeding up the detection of tandem repeats over the edit distance, Lempel-Ziv Factorization Revisited, Computing regularities in strings: a survey, Unnamed Item, Lazy Lempel-Ziv Factorization Algorithms