| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
The string searching problem is to find all occurrences of tile pattern(s) in a test string. The Aho-Corasick string searching algorithm finds simultaneously all occurrences of the multiple patterns d...uring one pass through the test. on the other hand, the Boyer-Moore algorithm is understood to be the fastest algorithm for a single pattern. By combining the ideas of these two algprithms, Uratani presented an efficierit string searching algpritnm for multiple patterns. The algorithm runs in sublinear time on the average as the BM algorithm achieves, and its preprocessing time is linear proportional to the sum of the length has the patterns like the AC algorithm. However, the correctness of the algorithm has not been discussed. In this paper. we prove the correctness of the algorithm.続きを見る
|
Mendeley出力
rifis-tr-7