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 - Review article
AN - SCOPUS:84871245739
SN - 0360-0300
VL - 45
JO - ACM Computing Surveys
JF - ACM Computing Surveys
IS - 1
M1 - 5
ER -