ON THE PREPROCESSING ALGORITHM USED IN THE BOYER-MOORE ALGORITHM FOR STRING SEARCHING.

被引：0

作者：

Semba, Ichiro ^{[1
]}

机构：

[1] Ibaraki Univ, Mito, Jpn, Ibaraki Univ, Mito, Jpn

来源：

Journal of information processing | 1986年 / 9卷 / 04期

关键词：

INFORMATION RETRIEVAL SYSTEMS - Performance;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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 plus 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 algorithms is better than previous algorithms proposed.

引用

页码：228 / 231

共 50 条

[41] THE BOYER-MOORE-GALIL STRING SEARCHING STRATEGIES REVISITED
APOSTOLICO, A
GIANCARLO, R
SIAM JOURNAL ON COMPUTING, 1986, 15 (01) : 98 - 105
[42] LZgrep: a Boyer-Moore string matching tool for Ziv-Lempel compressed text
Navarro, G
Tarhio, J
SOFTWARE-PRACTICE & EXPERIENCE, 2005, 35 (12): : 1107 - 1130
[43] BOYER-MOORE-GALIL STRING SEARCHING STRATEGIES REVISITED.
Apostolico, Alberto
Giancarlo, Raffaele
1600, (15):
[44] A STRING SEARCHING ALGORITHM
IYENGAR, SS
ALIA, V
APPLIED MATHEMATICS AND COMPUTATION, 1980, 6 (02) : 123 - 131
[45] Analysis of Boyer and Moore's MJRTY algorithm
Alonso, Laurent
Reingold, Edward M.
INFORMATION PROCESSING LETTERS, 2013, 113 (13) : 495 - 497
[46] PATSIM: Prediction and analysis of protein sequences using hybrid Knuth-Morris Pratt (KMP) and Boyer-Moore (BM) algorithm
Manikandan, P.
Ramyachitra, D.
GENE, 2018, 657 : 50 - 59
[47] FAST STRING SEARCHING ALGORITHM
BOYER, RS
MOORE, JS
COMMUNICATIONS OF THE ACM, 1977, 20 (10) : 762 - 772
[48] ON SIMON STRING SEARCHING ALGORITHM
HANCART, C
INFORMATION PROCESSING LETTERS, 1993, 47 (02) : 95 - 99
[49] FORMAL VERIFICATION OF SYNCHRONOUS CIRCUITS BASED ON STRING-FUNCTIONAL SEMANTICS - THE 7 PAILLET CIRCUITS IN BOYER-MOORE
BRONSTEIN, A
TALCOTT, CL
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 407 : 317 - 333
[50] AVERAGE RUNNING TIME OF THE BOYER-MOORE-HORSPOOL ALGORITHM
BAEZAYATES, RA
REGNIER, M
THEORETICAL COMPUTER SCIENCE, 1992, 92 (01) : 19 - 31

← 1 2 3 4 5 →