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)

Abstract

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
Volume45
Issue number1
DOIs
Publication statusPublished - Nov 2012

Fingerprint

Factorization
Text Compression
Strings
Computing

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

A comparison of index-based lempel-ziv LZ77 factorization algorithms. / Al-Hafeedh, Anisa; Crochemore, Maxime; Ilie, Lucian; Kopylova, Evguenia; Smyth, W. F.; Tischler, German; Yusufu, Munina.

In: ACM Computing Surveys, Vol. 45, No. 1, 5, 11.2012.

Research output: Contribution to journalArticle

Al-Hafeedh, A, Crochemore, M, Ilie, L, Kopylova, E, Smyth, WF, Tischler, G & Yusufu, M 2012, 'A comparison of index-based lempel-ziv LZ77 factorization algorithms', ACM Computing Surveys, vol. 45, no. 1, 5. https://doi.org/10.1145/2379776.2379781
Al-Hafeedh A, Crochemore M, Ilie L, Kopylova E, Smyth WF, Tischler G et al. A comparison of index-based lempel-ziv LZ77 factorization algorithms. ACM Computing Surveys. 2012 Nov;45(1). 5. https://doi.org/10.1145/2379776.2379781
Al-Hafeedh, Anisa ; Crochemore, Maxime ; Ilie, Lucian ; Kopylova, Evguenia ; Smyth, W. F. ; Tischler, German ; Yusufu, Munina. / A comparison of index-based lempel-ziv LZ77 factorization algorithms. In: ACM Computing Surveys. 2012 ; Vol. 45, No. 1.
@article{2a1d2199eedb4c2388d17a8a1bebd2bf,
title = "A comparison of index-based lempel-ziv LZ77 factorization algorithms",
abstract = "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.",
author = "Anisa Al-Hafeedh and Maxime Crochemore and Lucian Ilie and Evguenia Kopylova and Smyth, {W. F.} and German Tischler and Munina Yusufu",
year = "2012",
month = "11",
doi = "10.1145/2379776.2379781",
language = "English",
volume = "45",
journal = "ACM Computing Surveys",
issn = "0360-0300",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

TY - JOUR

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

AU - Al-Hafeedh, Anisa

AU - Crochemore, Maxime

AU - Ilie, Lucian

AU - Kopylova, Evguenia

AU - Smyth, W. F.

AU - Tischler, German

AU - Yusufu, Munina

PY - 2012/11

Y1 - 2012/11

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84871245739&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871245739&partnerID=8YFLogxK

U2 - 10.1145/2379776.2379781

DO - 10.1145/2379776.2379781

M3 - Article

AN - SCOPUS:84871245739

VL - 45

JO - ACM Computing Surveys

JF - ACM Computing Surveys

SN - 0360-0300

IS - 1

M1 - 5

ER -