Journal article
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 …
Authors
Al-Hafeedh A; Crochemore M; Ilie L; Kopylova E; Smyth WF; Tischler G; Yusufu M
Journal
ACM Computing Surveys, Vol. 45, No. 1, pp. 1–17
Publisher
Association for Computing Machinery (ACM)
Publication Date
11 2012
DOI
10.1145/2379776.2379781
ISSN
0360-0300