Tuning the Boyer-Moore-Horspool string searching algorithm

被引：0
|
作者：
Raita, Timo [1 ]
机构：
[1] Univ of Turku, Turku, Finland
来源：
Software - Practice and Experience | 1992年 / 22卷 / 10期
关键词：
Codes (symbols) - Computer programming - Data processing - Data structures - Heuristic methods - Pattern recognition - Performance - Subroutines;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Substring search is a common activity in computing. The fastest known search method is that of Boyer and Moore with the improvements introduced by Horspool. This paper presents a new implementation which takes advantage of the dependencies between the characters. The resulting code runs 25 per cent faster than the best currently-known routine.
引用
收藏
页码：879 / 884
相关论文
共 50 条
  • [31] 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
  • [32] Correctness of sub string-preprocessing in Boyer-Moore's pattern matching algorithm
    Stomp, F
    THEORETICAL COMPUTER SCIENCE, 2003, 290 (01) : 59 - 78
  • [33] Mechanization of a proof of string-preprocessing in Boyer-Moore's pattern matching algorithm
    Besta, M
    Stomp, F
    EIGHTH IEEE INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS, PROCEEDINGS, 2002, : 68 - 77
  • [34] 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
  • [35] Tuning approximate Boyer-Moore for gene sequences
    Kalsi, Petri
    Salmela, Leena
    Tarhio, Jorma
    STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 2007, 4726 : 173 - 183
  • [36] Approximate Boyer-Moore String Matching for Small Alphabets
    Salmela, Leena
    Tarhio, Jorma
    Kalsi, Petri
    ALGORITHMICA, 2010, 58 (03) : 591 - 609
  • [37] Approximate Boyer-Moore String Matching for Small Alphabets
    Leena Salmela
    Jorma Tarhio
    Petri Kalsi
    Algorithmica, 2010, 58 : 591 - 609
  • [38] Analysis of Boyer and Moore's MJRTY algorithm
    Alonso, Laurent
    Reingold, Edward M.
    INFORMATION PROCESSING LETTERS, 2013, 113 (13) : 495 - 497
  • [39] ON THE EXPECTED SUBLINEARITY OF THE BOYER-MOORE ALGORITHM
    SCHABACK, R
    SIAM JOURNAL ON COMPUTING, 1988, 17 (04) : 648 - 658
  • [40] 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