A Simple Algorithm for Computing the Lempel Ziv Factorization

Authors:
Maxime Crochemore;Lucian Ilie;W. F. Smyth
Affiliations:
-;-;-
Venue:
DCC '08 Proceedings of the Data Compression Conference
Year:
2008

Citing 0
Cited 18

An Online Algorithm for Finding the Longest Previous Factors

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Improved Variable-to-Fixed Length Codes

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
On the bit-complexity of Lempel-Ziv compression

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A Series of Run-Rich Strings

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Repetitions in strings: Algorithms and combinatorics

Theoretical Computer Science
On improving Tunstall codes

Information Processing and Management: an International Journal
Lempel-Ziv factorization revisited

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Hunting redundancies in strings

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Efficient algorithms for three variants of the LPF table

Journal of Discrete Algorithms
Parameterized longest previous factor

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Parameterized longest previous factor

Theoretical Computer Science
Variations of the parameterized longest previous factor

Journal of Discrete Algorithms
Computing lempel-ziv factorization online

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A comparison of index-based lempel-Ziv LZ77 factorization algorithms

ACM Computing Surveys (CSUR)
Computing regularities in strings: A survey

European Journal of Combinatorics
Computing the Longest Previous Factor

European Journal of Combinatorics
On parsing optimality for dictionary-based text compression-the Zip case

Journal of Discrete Algorithms
The Forward Stem Matrix: An Efficient Data Structure for Finding Hairpins in RNA Secondary Structures

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a space-efficient simple algorithm for computing the Lempel--Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independently of alphabet size and uses o(n) additional space.