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… (More)
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… (More)
  • figure 1
  • figure 2
  • table 2
Is this relevant?
2010
2010
The string matching problem has found wide application in computer science, molecular biology, genetic engineering, semantics and… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
Is this relevant?
2006
2006
We present the first derivation of the search phase of the Boyer-Moore stringmatching algorithm by partial evaluation of an… (More)
Is this relevant?
2000
2000
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we… (More)
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… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We show how to speed up two string-matching algorithms : the Boyer-Moore algorithm (BM algorithm) and its version called here the… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In the string-searching problem we have a pattern pat, of length m, all occurrences of which are to be found in a text string… (More)
  • figure I
Is this relevant?
1991
1991
The problem of finding all occurrences of a pattern of length m in a text of length n is considered. It is shown that the Boyer… (More)
  • figure 1
  • figure 4
  • figure 6
  • figure 8
  • figure 9
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… (More)
  • table 1
  • table 16
  • table 1
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Based on the Boyer-Moore-Galil approach. a new algorithm is proposed which requires a number of character comparisons bounded by… (More)
Is this relevant?