Conference
A simple algorithm for computing the Lempel-Ziv factorization
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 ${\cal O}(n)$ time independently of alphabet size and uses $o(n)$ additional space.
Authors
Crochemore M; Ilie L; Smyth WF
Pagination
pp. 482-488
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
March 1, 2008
DOI
10.1109/dcc.2008.36
Name of conference
Data Compression Conference (dcc 2008)
Conference proceedings
Proceedings DCC '98 Data Compression Conference (Cat No98TB100225)
ISSN
2375-0383