DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
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 independ...