Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,376,793 papers from all fields of science
Search
Sign In
Create Free Account
Boyer–Moore–Horspool algorithm
Known as:
Horspool
, Horspool's algoritm for string matching
, Boyer–Moore–Horspool
Expand
In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings. It was published…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Algorithm
Alphabet (formal languages)
Average-case complexity
Boyer–Moore string search algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Multi-Pattern Boyer-Moore - Horspool Algorithm based Hashing Function for Intrusion Detection System
A. Hasan
,
Aini Abdul Rashid
,
Muhannad A. Abu-Hashem
,
A. Abdulrazzaq
2013
Corpus ID: 17389263
Every day the networks are expanding in very large scale and running in very high speed. The Intrusion Detection System (IDS…
Expand
2013
2013
Fast Order-Preserving Pattern Matching
Sukhyeun Cho
,
J. Na
,
Kunsoo Park
,
J. Sim
International Conference on Combinatorial…
2013
Corpus ID: 7343431
Given a text T and a pattern P, the order-preserving pattern matching (OPPM) problem is to find all substrings in T which have…
Expand
2011
2011
Enhanced Pattern Matching Performance Using Improved Boyer Moore Horspool Algorithm
Dai Hong
2011
Corpus ID: 62104572
In computer science, the Boyer–Moore–Horspool algorithm is an algorithm for finding substrings in strings. A pattern matching…
Expand
2009
2009
Deriving the Boyer-Moore-Horspool algorithm
L. Cleophas
2009
Corpus ID: 1320185
The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been…
Expand
2008
2008
A Boyer-Moore-Horspool algorithm derivation
L. Cleophas
,
B. Watson
South African Computer Journal
2008
Corpus ID: 26377131
The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been…
Expand
Highly Cited
2001
Highly Cited
2001
Fast Content-Based Packet Handling for Intrusion Detection
M. Fisk
,
G. Varghese
2001
Corpus ID: 18959118
It is becoming increasingly common for network devices to handle packets based on the contents of packet payloads. Example…
Expand
2001
2001
The Boyer-Moore-Horspool heuristic with Markovian input
R. Smythe
Random Struct. Algorithms
2001
Corpus ID: 736922
The Boyer–Moore–Horspool string-matching heuristic is an algorithm for locating occurrences of a fixed pattern in a random text…
Expand
1998
1998
Standardised body condition scoring system for black rhinoceros (diceros bicornis)
H. Reuter
,
K. Adcock
1998
Corpus ID: 86331737
The body condition scoring system for black rhinoceros (Diceros bicornis), which has been described by Reuter, H.0. and Horspool…
Expand
Highly Cited
1993
Highly Cited
1993
Approximate Boyer-Moore String Matching
J. Tarhio
,
E. Ukkonen
SIAM journal on computing (Print)
1993
Corpus ID: 12246844
The Boyer–Moore idea applied in exact string matching is generalized to approximate string matching. Two versions of the problem…
Expand
1990
1990
Analysis of Boyer-Moore-type string searching algorithms
Ricardo Baeza-Yates
,
G. Gonnet
,
M. Régnier
ACM-SIAM Symposium on Discrete Algorithms
1990
Corpus ID: 5445465
We study Boyer-Moore-type string searching algorithms. First, we analyze the Horspool’s variant. The searching time is linear. An…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE