Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Boyer–Moore–Horspool algorithm

Known as: Horspool, Horspool's algoritm for string matching, Boyer–Moore–Horspool 
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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Every day the networks are expanding in very large scale and running in very high speed. The Intrusion Detection System (IDS… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2011
2011
In computer science, the Boyer–Moore–Horspool algorithm is an algorithm for finding substrings in strings. A pattern matching… Expand
Is this relevant?
2009
2009
The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been… Expand
  • figure 1
Is this relevant?
2008
2008
The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Worst-Case Execution Time and Energy Analysis T. Mitra, A. Roychoudhury Static Program Analysis for Security K. Gopinath Compiler… Expand
Is this relevant?
1995
1995
Please note that to save paper some of the appendices have been omitted from this version of the text. For that reason, there… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The Boyer–Moore idea applied in exact string matching is generalized to approximate string matching. Two versions of the problem… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
1992
1992
Abstract We study Boyer-Moore-type string searching algorithms. We analyze the Horspool's variant. The searching time is linear… Expand
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
  • Timo Raita
  • Softw. Pract. Exp.
  • 1992
  • Corpus ID: 14193323
SUMMARY Substring search is a common activity in computing. The fastest known search method is that of Boyer and Moore with the… Expand
  • figure I
Is this relevant?
1990
1990
We study Boyer-Moore-type string searching algorithms. First, we analyze the Horspool’s variant. The searching time is linear. An… Expand
  • table 1
  • figure 2
  • figure 3
  • table 2
  • table 3
Is this relevant?