Lempel-Ziv index for q-grams

DOI10.1007/PL00009205MaRDI QIDQ1386471zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(q\)-gramapproximate pattern matching algorithmsLempel-Ziv indexLempel-Ziv parsing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

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

Cited in

(12)

• Time-space trade-offs for Lempel-Ziv compressed indexing
• Linked dynamic tries with applications to LZ-compression in sublinear time and space
• Indexing text with approximate \(q\)-grams
• Compact q-gram profiling of compressed strings
• Lempel-Ziv index for \(q\)-grams
• scientific article; zbMATH DE number 1438578 (Why is no real title available?)
• Entropy lower bounds for dictionary compression
• String Indexing with Compressed Patterns
• Sublinear time Lempel-Ziv (LZ77) factorization
• A simple grammar-based index for finding approximately longest common substrings
• Lempel-Ziv factorization powered by space efficient suffix trees
• A compressed dynamic self-index for highly repetitive text collections

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)