Fast $q$-gram Mining on SLP Compressed Strings

Details Fast $q$-gram Mining on SLP Compressed Strings Fast $q$-gram Mining on SLP Compressed Strings

2011-03-16

arxiv.org/abs/1103.3114v2

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fast $q$-gram Mining on SLP Compressed Strings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast $q$-gram Mining on SLP Compressed Strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast $q$-gram Mining on SLP Compressed Strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-262426