Skip to main content
Article thumbnail
Location of Repository

Fast $q$-gram Mining on SLP Compressed Strings

By Keisuke Goto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda

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 $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

Topics: Computer Science - Data Structures and Algorithms
Year: 2011
OAI identifier: oai:arXiv.org:1103.3114
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1103.3114 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.