Fast \(q\)-gram mining on SLP compressed strings

DOI10.1016/j.jda.2012.07.006zbMath1267.68112OpenAlexW1547568556MaRDI QIDQ2376810

Masayuki Takeda, Keisuke Goto, Hideo Bannai, Shunsuke Inenaga

Publication date: 24 June 2013

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.07.006

zbMATH Keywords

straight-line programs\(q\)-gramscompressed string mining

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (4)

Compact q-gram profiling of compressed strings ⋮ Boosting over non-deterministic ZDDs ⋮ Compressed range minimum queries ⋮ A Space-Optimal Grammar Compression.

This page was built for publication: Fast \(q\)-gram mining on SLP compressed strings