Lempel-Ziv Factorization Using Less Time & Space

@article{Chen2008LempelZivFU,
  title={Lempel-Ziv Factorization Using Less Time & Space},
  author={Gang Chen and Simon J. Puglisi and William F. Smyth},
  journal={Mathematics in Computer Science},
  year={2008},
  volume={1},
  pages={605-623}
}
For 30 years the Lempel–Ziv factorization LZx of a string x = x[1..n] has been a fundamental data structure of string processing, especially valuable for string compression and for computing all the repetitions (runs) in x. Traditionally the standard method for computing LZx was based on Θ(n)-time (or, depending on the measure used, O(n log n)-time) processing of the suffix tree STx of x. Recently Abouelhoda et al. proposed an efficient Lempel–Ziv factorization algorithm based on an “enhanced… CONTINUE READING
Highly Cited
This paper has 45 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 29 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 49 references

J

F. Franek
Holub, W.F. Smyth & X. Xiao, Computing quasi suffix arrays, J. Automata, Languages & Combinatorics 8–4 • 2003
View 12 Excerpts
Highly Influenced

Detecting leftmost maximal periodicities

Discrete Applied Mathematics • 1989
View 5 Excerpts
Highly Influenced

Computing Patterns in Strings

B. Smyth
Pearson Addison-Wesley • 2003
View 2 Excerpts
Highly Influenced

A universal algorithm for sequential data compression

IEEE Trans. Information Theory • 1977
View 11 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…