Compact q-gram profiling of compressed strings
DOI10.1016/J.TCS.2014.07.010zbMATH Open1360.68961OpenAlexW2200718562WikidataQ60554388 ScholiaQ60554388MaRDI QIDQ401308FDOQ401308
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
Recommendations
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)
Cites Work
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Compression of individual sequences via variable-rate coding
- Efficient randomized pattern-matching algorithms
- A universal algorithm for sequential data compression
- The Smallest Grammar Problem
- Approximate string-matching with \(q\)-grams and maximal matches
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Lempel-Ziv index for \(q\)-grams
- Fast \(q\)-gram mining on SLP compressed strings
- Speeding up \(q\)-gram mining on grammar-based compressed texts
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On using q-gram locations in approximate string matching
Cited In (4)
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)
