| 作成者 |
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
We show an efficient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operation is the concatena...tion. In this paper, both text T and pattern P are given by straight-line programs T and P. The length of the text T (pattern P, resp.) may grows exponentially with respect to its description size $ mid T mid = n left(mid P mid = m, resp.\right). $ We show a new combinatorial property concerning with the periodic occurrences in a text. Based on this property, we develop an $ Oleft(n^2m^2\right) $ time algorithm using O(nm) space, which outputs a compact representation of all occurrences of P in T. This is superior to the algorithm proposed by Karpinski et al. [11],which runs in $ Oleft((n+m)^4log (n+m)\right) $ time using $ O left(( n+m)^3\right) $ space, and finds only one occurrence. Moreover, our algorithm is much simpler than theirs.続きを見る
|
Mendeley出力
doi-tr-130