Skip to main content
Conference Proceedings

Indexing text using the ziv-lempel trie

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2476 325-336
DOI: 10.1007/3-540-45735-6_28
9Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let a text of u characters over an alphabet of size σ be compressible to n symbols by the LZ78 or LZW algorithm. We show that it is possible to build a data structure based on the Ziv-Lempel trie that takes 4n log2 n(1+o(1)) bits of space and reports the R occurrences of a pattern of length m in worst case time O(m2 log(mσ)+(m+R)log n).

Cite

CITATION STYLE

APA

Navarro, G. (2002). Indexing text using the ziv-lempel trie. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2476, pp. 325–336). Springer Verlag. https://doi.org/10.1007/3-540-45735-6_28

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