A comparison of index-based lempel-Ziv LZ77 factorization algorithms - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Computing Surveys Année : 2012

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-00836948 , version 1 (21-06-2013)

Identifiants

Citer

Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, William F. Smyth, et al.. A comparison of index-based lempel-Ziv LZ77 factorization algorithms. ACM Computing Surveys, 2012, 45 (1), pp.1-17. ⟨10.1145/2379776.2379781⟩. ⟨hal-00836948⟩
314 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More