Skip to main content
Log in

Lempel—Ziv Index for q -Grams

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

We present a new sublinear-size index structure for finding all occurrences of a given q -gram in a text. Such a q -gram index is needed in many approximate pattern matching algorithms. All earlier q -gram indexes require at least O(n) space, where n is the length of the text. The new Lempel—Ziv index needs only O(n/log n) space while being as fast as previous methods. The new method takes advantage of repetitions in the text found by Lempel—Ziv parsing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received November 1996; revised March 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kärkkäinen, J., Sutinen, E. Lempel—Ziv Index for q -Grams . Algorithmica 21, 137–154 (1998). https://doi.org/10.1007/PL00009205

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009205

Navigation