### Abstract

Text mining from large scaled data is of great importance in computer science. In this paper, we consider fundamental problems on text mining from compressed strings, i.e., computing a longest repeating substring, longest non-overlapping repeating substring, most frequent substring, and most frequent non-overlapping substring from a given compressed string. Also, we tackle the following novel problem: given a compressed text and compressed pattern, compute the representative of the equivalence class of the pattern w.r.t. the text. We present algorithms that solve the above problems in time polynomial in the size of input compressed strings. The compression scheme we consider is straight line program (SLP) which has exponential compression, and therefore our algorithms are more efficient than any existing algorithms that require decompression of given SLPs.

Original language | English |
---|---|

Pages (from-to) | 261-280 |

Number of pages | 20 |

Journal | International Journal of Foundations of Computer Science |

Volume | 23 |

Issue number | 2 |

DOIs | |

Publication status | Published - Feb 1 2012 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Science (miscellaneous)

### Cite this

**Finding characteristic substrings from compressed texts.** / Inenaga, Shunsuke; Bannai, Hideo.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - Finding characteristic substrings from compressed texts

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

PY - 2012/2/1

Y1 - 2012/2/1

N2 - Text mining from large scaled data is of great importance in computer science. In this paper, we consider fundamental problems on text mining from compressed strings, i.e., computing a longest repeating substring, longest non-overlapping repeating substring, most frequent substring, and most frequent non-overlapping substring from a given compressed string. Also, we tackle the following novel problem: given a compressed text and compressed pattern, compute the representative of the equivalence class of the pattern w.r.t. the text. We present algorithms that solve the above problems in time polynomial in the size of input compressed strings. The compression scheme we consider is straight line program (SLP) which has exponential compression, and therefore our algorithms are more efficient than any existing algorithms that require decompression of given SLPs.

AB - Text mining from large scaled data is of great importance in computer science. In this paper, we consider fundamental problems on text mining from compressed strings, i.e., computing a longest repeating substring, longest non-overlapping repeating substring, most frequent substring, and most frequent non-overlapping substring from a given compressed string. Also, we tackle the following novel problem: given a compressed text and compressed pattern, compute the representative of the equivalence class of the pattern w.r.t. the text. We present algorithms that solve the above problems in time polynomial in the size of input compressed strings. The compression scheme we consider is straight line program (SLP) which has exponential compression, and therefore our algorithms are more efficient than any existing algorithms that require decompression of given SLPs.

UR - http://www.scopus.com/inward/record.url?scp=84863101615&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863101615&partnerID=8YFLogxK

U2 - 10.1142/S0129054112400126

DO - 10.1142/S0129054112400126

M3 - Article

VL - 23

SP - 261

EP - 280

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 2

ER -