WEKO3
アイテム
On the Preprocessing Algorithm Used in the Boyer-Moore Algorithm for String Searching
https://ipsj.ixsq.nii.ac.jp/records/59838
https://ipsj.ixsq.nii.ac.jp/records/598389554c927-c4e8-4bca-8ea0-0fb43b8be4af
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JIP0904003.pdf (333.2 kB)
|
Copyright (c) 1987 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | JInfP(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1987-03-15 | |||||||
| タイトル | ||||||||
| タイトル | On the Preprocessing Algorithm Used in the Boyer-Moore Algorithm for String Searching | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | On the Preprocessing Algorithm Used in the Boyer-Moore Algorithm for String Searching | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| College of General Education Ibaraki University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| College of General Education, Ibaraki University | ||||||||
| 著者名 |
Ichiro, Semba
× Ichiro, Semba
|
|||||||
| 著者名(英) |
Ichiro, Semba
× Ichiro, Semba
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | We consider the preprocessing algorithm for Boyer-Moore string-searching. This paper proposes a natural preprocessing algorithm coming to our mind. The average running time per pattern of length m is proved to be O(m+m^2/q) under the assumption that q possible characters appear uniformly. The computer experiments show that the average running time per pattern of our algorithm is better than previous algorithms proposed. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | We consider the preprocessing algorithm for Boyer-Moore string-searching. This paper proposes a natural preprocessing algorithm coming to our mind. The average running time per pattern of length m is proved to be O(m+m^2/q) under the assumption that q possible characters appear uniformly. The computer experiments show that the average running time per pattern of our algorithm is better than previous algorithms proposed. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA00700121 | |||||||
| 書誌情報 |
Journal of Information Processing 巻 9, 号 4, p. 228-231, 発行日 1987-03-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6652 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
