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.
Document type :
Journal articles
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00836948
Contributor : Maxime Crochemore <>
Submitted on : Friday, June 21, 2013 - 6:01:48 PM
Last modification on : Friday, February 22, 2019 - 11:10:08 AM

Identifiers

Citation

Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, William Smyth, et al.. A comparison of index-based lempel-Ziv LZ77 factorization algorithms. ACM Computing Surveys, Association for Computing Machinery, 2012, 45 (1), pp.1-17. ⟨10.1145/2379776.2379781⟩. ⟨hal-00836948⟩

Share

Metrics

Record views

524