Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,017,881 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
2011
2011
The Extended Boyer-Moore-Horspool Algorithm for Locality-Sensitive Pseudo-code
Kengo Terasawa
,
T. Kawashima
,
Yuzuru Tanaka
International Conference on Computer Vision…
2011
Corpus ID: 29245796
Boyer-Moore-Horspool (BMH) algorithm is known as a very efficient algorithm that finds a place where a certain string specified…
Expand
2010
2010
Computing an Ontological Semantics for a Natural Language Fragment
Bartlomiej Antoni Szymczak
,
J. Nilsson
,
Per Anker Jensen
2010
Corpus ID: 64677605
The key objective of the research that has been carried out has been to establish theoretically sound connections between the…
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
2004
2004
Reducing non-determinism in right nulled GLR parsers
E. Scott
,
A. Johnstone
Acta Informatica
2004
Corpus ID: 839992
Abstract.Tomita’s general parsing algorithm is linear on LR(1) grammars but fails to terminate on grammars with hidden left…
Expand
2003
2003
Incremental algorithms for dispatching in dynamically typed languages
Yoav Zibin
,
J. Gil
ACM-SIGACT Symposium on Principles of Programming…
2003
Corpus ID: 5210340
A fundamental problem in the implementation of object-oriented languages is that of a frugal <i>dispatching data structure</i>, i…
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
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