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

Authors:
Anisa Al-Hafeedh;Maxime Crochemore;Lucian Ilie;Evguenia Kopylova;W.F. Smyth;German Tischler;Munina Yusufu
Affiliations:
McMaster University and Sultan Qaboos University, Al-Khodh, Sultanate of Oman;King's College London;University of Western Ontario;McMaster University and Université Lille 1, France;McMaster University and Curtin University of Technology;University of Würzburg, Germany;McMaster University
Venue:
ACM Computing Surveys (CSUR)
Year:
2012

Citing 41
Cited 1

Transducers and repetitions

Theoretical Computer Science
Modeling for text compression

ACM Computing Surveys (CSUR)
Detecting leftmost maximal periodicities

Discrete Applied Mathematics - Combinatorics and complexity
Approximate string-matching with q-grams and maximal matches

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Data compression via textual substitution

Journal of the ACM (JACM)
The Data Compression Book

The Data Compression Book
Succinct representations of lcp information and improvements in the compressed suffix arrays

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Simple and flexible detection of contiguous repeats using a suffix tree

Theoretical Computer Science
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Finding Maximal Repetitions in a Word in Linear Time

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Finding Repeats with Fixed Gap

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Replacing suffix trees with enhanced suffix arrays

Journal of Discrete Algorithms - SPIRE 2002
Computing quasi suffix arrays

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Engineering a Lightweight Suffix Array Construction Algorithm

Algorithmica
Linear-time computation of local periods

Theoretical Computer Science
Linear time algorithms for finding and representing all the tandem repeats in a string

Journal of Computer and System Sciences
A taxonomy of suffix array construction algorithms

ACM Computing Surveys (CSUR)
Computing Longest Previous Factor in linear time and applications

Information Processing Letters
Maximal repetitions in strings

Journal of Computer and System Sciences
A Simple Algorithm for Computing the Lempel Ziv Factorization

DCC '08 Proceedings of the Data Compression Conference
Fast and Practical Algorithms for Computing All the Runs in a String

CPM '07 Proceedings of the 18th annual symposium on Combinatorial Pattern Matching
Towards a Solution to the "Runs" Conjecture

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
An Online Algorithm for Finding the Longest Previous Factors

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Linear Time Suffix Array Construction Using D-Critical Substrings

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Permuted Longest-Common-Prefix Array

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
LPF Computation Revisited

Combinatorial Algorithms
Handbook of Data Compression

Handbook of Data Compression
Space efficient linear time construction of suffix arrays

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Crochemore factorization of sturmian and other infinite words

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the Complexity of Finite Sequences

IEEE Transactions on Information Theory
A universal algorithm for sequential data compression

IEEE Transactions on Information Theory
Compression of individual sequences via variable-rate coding

IEEE Transactions on Information Theory
Dynamic rank-select structures with applications to run-length encoded texts

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
A new succinct representation of RMQ-information and improvements in the enhanced suffix array

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Computing regularities in strings: A survey

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.