Skip to main content
Conference Proceedings

Faster lightweight Lempel-Ziv parsing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9235 432-444
DOI: 10.1007/978-3-662-48054-0_36
9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an algorithm that computes the Lempel-Ziv decomposition in O(n(log σ + log log n)) time and n log σ + ɛn bits of space, where ϵ; is a constant rational parameter, n is the length of the input string, and σ is the alphabet size. The n log σ bits in the space bound are for the input string itself which is treated as read-only.

Cite

CITATION STYLE

APA

Kosolobov, D. (2015). Faster lightweight Lempel-Ziv parsing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9235, pp. 432–444). Springer Verlag. https://doi.org/10.1007/978-3-662-48054-0_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free