Lempel-Ziv index for q-grams

DOI10.1007/PL00009205zbMATH Open0896.68069OpenAlexW2018599113MaRDI QIDQ1386471FDOQ1386471

Authors: Juha Kärkkäinen, Erkki Sutinen 

Publication date: 24 May 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009205

Recommendations

• Lempel-Ziv index for \(q\)-grams
• scientific article; zbMATH DE number 1438578
• Indexing text with approximate \(q\)-grams
• Indexing text using the Ziv--Lempel trie

zbMATH Keywords

\(q\)-gramLempel-Ziv parsingapproximate pattern matching algorithmsLempel-Ziv index

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (11)

• Compact q-gram profiling of compressed strings
• Lempel-Ziv factorization powered by space efficient suffix trees
• Lempel-Ziv index for \(q\)-grams
• Indexing text with approximate \(q\)-grams
• String Indexing with Compressed Patterns
• Linked dynamic tries with applications to LZ-compression in sublinear time and space
• A compressed dynamic self-index for highly repetitive text collections
• Time-space trade-offs for Lempel-Ziv compressed indexing
• Title not available (Why is that?)
• A simple grammar-based index for finding approximately longest common substrings
• Sublinear time Lempel-Ziv (LZ77) factorization

This page was built for publication: Lempel-Ziv index for \(q\)-grams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386471)