Journal article
A comparison of index-based lempel-Ziv LZ77 factorization algorithms
ACM Computing Surveys, Vol.45(1), pp.1-17
2012
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.
Details
- Title
- A comparison of index-based lempel-Ziv LZ77 factorization algorithms
- Authors/Creators
- A. Al-Hafeedh (Author/Creator) - Sultan Qaboos UniversityM. Crochemore (Author/Creator) - King's College LondonL. Ilie (Author/Creator) - Western UniversityE. Kopylova (Author/Creator) - Université de LilleW.F. Smyth (Author/Creator) - Curtin UniversityG. Tischler (Author/Creator) - University of WürzburgM. Yusufu (Author/Creator) - McMaster-Carr
- Publication Details
- ACM Computing Surveys, Vol.45(1), pp.1-17
- Publisher
- ACM Digital Library
- Identifiers
- 991005541258907891
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Journal article
Metrics
64 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Domestic collaboration
- International collaboration
- Citation topics
- 4 Electrical Engineering, Electronics & Computer Science
- 4.182 Data Structures, Algorithms & Complexity
- 4.182.1103 Efficient Algorithms
- Web Of Science research areas
- Computer Science, Theory & Methods
- ESI research areas
- Computer Science