Compact q-gram profiling of compressed strings
From MaRDI portal
Publication:401308
DOI10.1016/j.tcs.2014.07.010zbMath1360.68961OpenAlexW2200718562WikidataQ60554388 ScholiaQ60554388MaRDI QIDQ401308
Inge Li Gørtz, Patrick Hagge Cording, Philip Bille
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
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Approximate string-matching with \(q\)-grams and maximal matches
- Lempel-Ziv index for \(q\)-grams
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Fast \(q\)-gram mining on SLP compressed strings
- Speeding Up q-Gram Mining on Grammar-Based Compressed Texts
- The Smallest Grammar Problem
- Efficient randomized pattern-matching algorithms
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- On using q-gram locations in approximate string matching
