Fast q-gram mining on SLP compressed strings

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)89-99
Number of pages11
JournalJournal of Discrete Algorithms
Volume18
DOIs
Publication statusPublished - Jan 2013

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Fast q-gram mining on SLP compressed strings'. Together they form a unique fingerprint.

  • Cite this