検索結果 7 件
紙記事
全国の図書館
- 出版者（掲載誌）Springer-Verlag
紙記事
全国の図書館
- 出版者（掲載誌）Springer-Verlag
紙記事
全国の図書館
- 出版者（掲載誌）Springer-Verlag
デジタル記事
インターネットで読める全国の図書館
- 要約等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 oper......concatenation. 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 ......show a new combinatorial property concerning with the peri......ic occurrences of a pattern in a text. Based ......ty, we develop an O(n2m2) time algorithm using O(nm) space, ......representation of all occurrences of P in T. This is superior to the algorithm proposed by Karpinski et al. [11], which runs in...
- 参照Detecting regularities ......mar-compressed strings Compressed Automata for Dictionary Matching An efficient algorithm to test square-freeness of strings compressed by straight-line programs Efficient Lynd...... Factorization of Grammar Compre......er Subsequence and Don’t-Care Pattern Matching on Compressed Texts
- 著者標目Masamichi Miyazaki Ayumi Shinohara Masayuki Takeda
デジタル規格・テクニカルリポート類
インターネットで読める全国の図書館
- 要約等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 oper......concatenation. In this paper, both text $ T $ and pattern $ P $ are given by straight-line programs $ \tau $ and $ \rho $. The length of the text $ T $ (pattern $ P $, resp.) ......show a new combinatorial property concerning with the peri......ic occurrences in a text. Based ......ty, we develop an $ O(n^2m^2) $ time algorithm using $ O(nm) $ spa......representation of all occurrences of $ P $ in $ T $. This is......uperior to the algorithm proposed by Karpinski et al.[...
紙記事
全国の図書館
- 出版者（掲載誌）Springer-Verlag