Fast q-gram mining on SLP compressed strings

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

研究成果: Contribution to journalArticle査読

13 被引用数 (Scopus)

抄録

We present simple and efficient algorithms for calculating q-gram frequencies on strings represented in compressed form, namely, as a straight line program (SLP). Given an SLP of size n that represents string T, we present an O(qn) time and space algorithm that computes the occurrence frequencies of all q-grams in T. Computational experiments show that our algorithm and its variation are practical for small q, actually running faster on various real string data, compared to algorithms that work on the uncompressed text. We also discuss applications in data mining and classification of string data, for which our algorithms can be useful.

本文言語英語
ページ(範囲)89-99
ページ数11
ジャーナルJournal of Discrete Algorithms
18
DOI
出版ステータス出版済み - 1 2013

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • 離散数学と組合せ数学
  • 計算理論と計算数学

フィンガープリント

「Fast q-gram mining on SLP compressed strings」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル