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

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

Research output: Contribution to journalArticle

17 Citations (Scopus)


Since 1977, when Lempel and Ziv described a kind of string factorization useful for text compression, there has been a succession of algorithms proposed for computing "LZ factorization". In particular, there have been several recent algorithms proposed that extend the usefulness of LZ factorization, for example, to the calculation of maximal repetitions. In this article, we provide an overview of these new algorithms and compare their efficiency in terms of their usage of time and space.

Original languageEnglish
Article number5
JournalACM Computing Surveys
Issue number1
Publication statusPublished - Nov 2012


ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Al-Hafeedh, A., Crochemore, M., Ilie, L., Kopylova, E., Smyth, W. F., Tischler, G., & Yusufu, M. (2012). A comparison of index-based lempel-ziv LZ77 factorization algorithms. ACM Computing Surveys, 45(1), [5]. https://doi.org/10.1145/2379776.2379781