- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Automatic Translation feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
On Improving the Average Case of the Boyer-Moore String Matching Algorithm
-
- FENG Z. -R.
- Department of Information Science, Ibaraki University
-
- TAKAOKA TADAO
- Department of Information Science, Ibaraki University
Search this article
Description
It is shown how to modify the Boyer-Moore string matching algorithm so that the number of characters actually inspected and the running time decrease sharply as the length of pattern gets longer.
Journal
-
- J. of Information Proc.
-
J. of Information Proc. 10 173-177, 1988
Information Processing Society of Japan (IPSJ)
- Tweet
Details 詳細情報について
-
- CRID
- 1572261552009510272
-
- NII Article ID
- 110002673445
-
- NII Book ID
- AA00700121
-
- ISSN
- 03876101
-
- Text Lang
- en
-
- Data Source
-
- CiNii Articles
