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.
Index Terms:
algorithms design, strings, suffix array, longest common prefix, longest previous factor, Lempel--Ziv factorization, repetitions, runs
Citation:
Maxime Crochemore, Lucian Ilie, W. F. Smyth, "A Simple Algorithm for Computing the Lempel Ziv Factorization," dcc, pp.482-488, Data Compression Conference (dcc 2008), 2008