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 条
  • [21] IMPROVING THE WORST CASE RUNNING TIME OF THE BOYER-MOORE STRING MATCHING ALGORITHM
    GALIL, Z
    COMMUNICATIONS OF THE ACM, 1979, 22 (09) : 505 - 508
  • [22] Average case analysis of the Boyer-Moore algorithm
    Tsai, Tsung-Hsi
    RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (04) : 481 - 498
  • [23] APPROXIMATE BOYER-MOORE STRING MATCHING
    TARHIO, J
    UKKONEN, E
    SIAM JOURNAL ON COMPUTING, 1993, 22 (02) : 243 - 260
  • [24] Fast-search: A new efficient variant of the Boyer-Moore string matching algorithm
    Cantone, D
    Faro, S
    EXPERIMENTAL AND EFFICIENCT ALGORITHMS, PROCEEDINGS, 2003, 2647 : 47 - 58
  • [25] A Method for Web Application Vulnerabilities Detection by Using Boyer-Moore String Matching Algorithm
    Saleh, Ain Zubaidah Mohd
    Rozali, Nur Amizah
    Buja, Alya Geogiana
    Jalil, Kamarularifin Abd.
    Ali, Fakariah Hani Mohd
    Rahman, Teh Faradilla Abdul
    THIRD INFORMATION SYSTEMS INTERNATIONAL CONFERENCE 2015, 2015, 72 : 112 - 121
  • [26] Fingerprint Identification using Bozorth and Boyer-Moore Algorithm
    Supatmi, S.
    Sumitra, I. D.
    2ND INTERNATIONAL CONFERENCE ON INFORMATICS, ENGINEERING, SCIENCE, AND TECHNOLOGY (INCITEST 2019), 2019, 662
  • [27] A Boyer-Moore type algorithm for compressed pattern matching
    Shibata, Y
    Matsumoto, T
    Takeda, M
    Shinohara, A
    Arikawa, S
    COMBINATORIAL PATTERN MATCHING, 2000, 1848 : 181 - 194
  • [28] A Boyer-Moore Type Algorithm for Timed Pattern Matching
    Waga, Masaki
    Akazaki, Takumi
    Hasuo, Ichiro
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, FORMATS 2016, 2016, 9884 : 121 - 139
  • [29] BOYER-MOORE APPROACH TO APPROXIMATE STRING MATCHING
    TARHIO, J
    UKKONEN, E
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 447 : 348 - 359
  • [30] A New Method to Obtain the shift-table in Boyer-Moore's String Matching Algorithm
    Wang, Yang
    19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6, 2008, : 3282 - 3285
12345