Speeding Up q-Gram Mining on Grammar-Based Compressed Texts

DOI10.1007/978-3-642-31265-6_18zbMath1358.68339arXiv1202.3311OpenAlexW3098704848MaRDI QIDQ2904495

Shunsuke Inenaga, Masayuki Takeda, Keisuke Goto, Hideo Bannai

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.3311

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Related Items (2)

LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding ⋮ Compact q-gram profiling of compressed strings

This page was built for publication: Speeding Up q-Gram Mining on Grammar-Based Compressed Texts