Sciweavers

Share
DCC
2008
IEEE

A Simple Algorithm for Computing the Lempel Ziv Factorization

9 years 10 months ago
A Simple Algorithm for Computing the Lempel Ziv Factorization
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.
Maxime Crochemore, Lucian Ilie, W. F. Smyth
Added 25 Dec 2009
Updated 25 Dec 2009
Type Conference
Year 2008
Where DCC
Authors Maxime Crochemore, Lucian Ilie, W. F. Smyth
Comments (0)
books