Compact q-gram profiling of compressed strings

DOI10.1016/J.TCS.2014.07.010MaRDI QIDQ401308zbMATHOpenAlexWikidataFDO

Authors Philip Bille, Patrick Hagge Cording, Inge Li Gørtz

Publication date 26 August 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2014.07.010

zbMATH Keywords

SLPgrammar compressionq-gram profile

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)

Recommendations

• Compact \(q\)-gram profiling of compressed strings
• Speeding up \(q\)-gram mining on grammar-based compressed texts
• Fast \(q\)-gram mining on SLP compressed strings
• Computing \(q\)-gram non-overlapping frequencies on SLP compressed texts
• Access, rank, and select in grammar-compressed strings

Cites work

• scientific article; zbMATH DE number 176144 (Why is no real title available?)
• scientific article; zbMATH DE number 1934569 (Why is no real title available?)
• scientific article; zbMATH DE number 1555939 (Why is no real title available?)
• A universal algorithm for sequential data compression
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Approximate string-matching with \(q\)-grams and maximal matches
• Compression of individual sequences via variable-rate coding
• Efficient algorithms to compute compressed longest common substrings and compressed palindromes
• Efficient randomized pattern-matching algorithms
• Fast \(q\)-gram mining on SLP compressed strings
• Lempel-Ziv index for \(q\)-grams
• On using q-gram locations in approximate string matching
• Speeding up \(q\)-gram mining on grammar-based compressed texts
• The Smallest Grammar Problem

Cited in

(4)

• Computing \(q\)-gram non-overlapping frequencies on SLP compressed texts
• Fast \(q\)-gram mining on SLP compressed strings
• Compact \(q\)-gram profiling of compressed strings
• Speeding up \(q\)-gram mining on grammar-based compressed texts

This page was built for publication: Compact q-gram profiling of compressed strings

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