### 抄録

We study the fully compressed pattern matching problem (FCPM problem): Given T and P which are descriptions of text T and pattern P respectively, find the occurrences of P in T without decompressing T or P. This problem is rather challenging since patterns are also given in a compressed form. In this paper we present an FCPM algorithm for simple collage systems. Collage systems are a general framework representing various kinds of dictionary-based compressions in a uniform way, and simple collage systems are a subclass that includes LZW and LZ78 compressions. Collage systems are of the form (〈D, S〉, where D is a dictionary and S is a sequence of variables from D. Our FCPM algorithm performs in O(∥D∥ ^{2} + mn log|S|) time, where n = |T| = ∥D∥ + |S| and m = |P|. This is faster than the previous best result of O(m ^{2}n ^{2}) time.

元の言語 | 英語 |
---|---|

ページ（範囲） | 1155-1166 |

ページ数 | 12 |

ジャーナル | International Journal of Foundations of Computer Science |

巻 | 16 |

発行部数 | 6 |

DOI | |

出版物ステータス | 出版済み - 12 1 2005 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Science (miscellaneous)

### これを引用

**A fully compressed pattern matching algorithm for simple collage systems.** / Inenaga, Shunsuke; Shinohara, Ayumi; Takeda, Masayuki.

研究成果: ジャーナルへの寄稿 › 記事

*International Journal of Foundations of Computer Science*, 巻. 16, 番号 6, pp. 1155-1166. https://doi.org/10.1142/S0129054105003728

}

TY - JOUR

T1 - A fully compressed pattern matching algorithm for simple collage systems

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

PY - 2005/12/1

Y1 - 2005/12/1

N2 - We study the fully compressed pattern matching problem (FCPM problem): Given T and P which are descriptions of text T and pattern P respectively, find the occurrences of P in T without decompressing T or P. This problem is rather challenging since patterns are also given in a compressed form. In this paper we present an FCPM algorithm for simple collage systems. Collage systems are a general framework representing various kinds of dictionary-based compressions in a uniform way, and simple collage systems are a subclass that includes LZW and LZ78 compressions. Collage systems are of the form (〈D, S〉, where D is a dictionary and S is a sequence of variables from D. Our FCPM algorithm performs in O(∥D∥ 2 + mn log|S|) time, where n = |T| = ∥D∥ + |S| and m = |P|. This is faster than the previous best result of O(m 2n 2) time.

AB - We study the fully compressed pattern matching problem (FCPM problem): Given T and P which are descriptions of text T and pattern P respectively, find the occurrences of P in T without decompressing T or P. This problem is rather challenging since patterns are also given in a compressed form. In this paper we present an FCPM algorithm for simple collage systems. Collage systems are a general framework representing various kinds of dictionary-based compressions in a uniform way, and simple collage systems are a subclass that includes LZW and LZ78 compressions. Collage systems are of the form (〈D, S〉, where D is a dictionary and S is a sequence of variables from D. Our FCPM algorithm performs in O(∥D∥ 2 + mn log|S|) time, where n = |T| = ∥D∥ + |S| and m = |P|. This is faster than the previous best result of O(m 2n 2) time.

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

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

U2 - 10.1142/S0129054105003728

DO - 10.1142/S0129054105003728

M3 - Article

VL - 16

SP - 1155

EP - 1166

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 6

ER -