Skip to main content
Conference Proceedings

Lempel-ziv index for q-grams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1136 378-391
DOI: 10.1007/3-540-61680-2_69
0Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a new sublinear-size index structure for q-grams. A q-gram index of the text is used in many approximate pattern matching algorithms. All earlier q-gram indexes have at least linear size. The new method takes advantage of repetitious in the text found by Lempel-Ziv parsing.

Cite

CITATION STYLE

APA

K Ä Rkk Ä Inen, J., & Sutinen, E. (1996). Lempel-ziv index for q-grams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1136, pp. 378–391). Springer Verlag. https://doi.org/10.1007/3-540-61680-2_69

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