Abstract
For 30 years the Lempel-Ziv factorization of a string has played an important role in data compression, and more recently it was used as the basis of linear time algorithms for the detection of all maximal repetitions (runs) in a string. In this paper, we present two new linear time algorithms: the first one is the fastest and the second is the most space-efficient among all LZ-factorization algorithms known so far. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Ohlebusch, E., & Gog, S. (2011). Lempel-Ziv factorization revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6661 LNCS, pp. 15–26). https://doi.org/10.1007/978-3-642-21458-5_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
