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

Boyer–Moore string search algorithm

Known as: Moore, Boyer (disambiguation), Boyer–Moore 
In computer science, the Boyer–Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Boyer Moore string matching algorithm is one of the famous algorithms used in string search algorithms. Widely, it is used in… Expand
  • figure 1
  • figure 2
  • table 2
Is this relevant?
2006
2006
We present the first derivation of the search phase of the Boyer-Moore string-matching algorithm by partial evaluation of an… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
  • W. Young
  • Journal of Automated Reasoning
  • 2004
  • Corpus ID: 27052644
We describe the specification, implementation and proof of correctness of a code generator for a subset of Gypsy 2.05. The code… Expand
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper proposes a quick method of similarity-based signal searching to detect and locate a specific audio or video signal… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
We present a new variant of the Boyer-Moore string matching algorithm which, though not linear, is very fast in practice. We… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Since it was first developed in 1995 by Bernie Dodge with Tom March, the WebQuest model has been incorporated into hundreds of… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper uses the newly developed RICE-98 model to analyze the economics of the Kyoto Protocol. It analyzes versions of the… Expand
  • figure 2
  • figure 3
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
  • T. Lecroq
  • Theor. Comput. Sci.
  • 1992
  • Corpus ID: 9574223
String-matching consists in finding all the occurrences of a word w in a text t. Several algorithms have been found for solving… Expand
  • figure 1
  • figure 3
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1990
Highly Cited
1990
This article describes a substring search algorithm that is faster than the Boyer-Moore algorithm. This algorithm does not depend… Expand
  • table 1
  • table 16
  • table 1
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We propose the use of explicit proof plans to guide the search for a proof in automatic theorem proving. By representing proof… Expand
  • figure 1
  • figure 2
  • table 3
  • table 4
  • table 5
Is this relevant?