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.

• Type: Conference
• Year: 2008
• Where: DCC
• Authors: Maxime Crochemore, Lucian Ilie, W. F. Smyth
• Keywords: Alphabet Size, Computer Graphics, DCC 2008, Space-efficient Simple Algorithm