<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
the	O
Boyer	B-Algorithm
–	I-Algorithm
Moore	I-Algorithm
string-search	I-Algorithm
algorithm	I-Algorithm
is	O
an	O
efficient	O
string-searching	B-Algorithm
algorithm	I-Algorithm
that	O
is	O
the	O
standard	O
benchmark	O
for	O
practical	O
string-search	O
literature	O
.	O
</s>
<s>
The	O
algorithm	O
preprocesses	B-General_Concept
the	O
string	O
being	O
searched	O
for	O
(	O
the	O
pattern	O
)	O
,	O
but	O
not	O
the	O
string	O
being	O
searched	O
in	O
(	O
the	O
text	O
)	O
.	O
</s>
<s>
The	O
Boyer	O
–	O
Moore	O
algorithm	O
uses	O
information	O
gathered	O
during	O
the	O
preprocess	O
step	O
to	O
skip	O
sections	O
of	O
the	O
text	O
,	O
resulting	O
in	O
a	O
lower	O
constant	O
factor	O
than	O
many	O
other	O
string	B-Algorithm
search	I-Algorithm
algorithms	I-Algorithm
.	O
</s>
<s>
Instead	O
of	O
a	O
brute-force	B-Algorithm
search	I-Algorithm
of	O
all	O
alignments	O
(	O
of	O
which	O
there	O
are	O
)	O
,	O
Boyer	O
–	O
Moore	O
uses	O
information	O
gained	O
by	O
preprocessing	O
to	O
skip	O
as	O
many	O
alignments	O
as	O
possible	O
.	O
</s>
<s>
A	O
generalized	O
version	O
for	O
dealing	O
with	O
submatches	O
was	O
reported	O
in	O
1985	O
as	O
the	O
Apostolico	B-Algorithm
–	I-Algorithm
Giancarlo	I-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
In	O
C++	B-Language
it	O
is	O
part	O
of	O
the	O
Standard	O
Library	O
since	O
C++17	O
,	O
also	O
Boost	B-Language
provides	O
the	O
implementation	O
under	O
the	O
Algorithm	O
library	O
.	O
</s>
<s>
D	B-Application
(	O
programming	O
language	O
)	O
uses	O
a	O
for	O
predicate	O
based	O
matching	O
within	O
ranges	O
as	O
a	O
part	O
of	O
the	O
Phobos	O
Runtime	O
Library	O
.	O
</s>
<s>
The	O
Boyer	O
–	O
Moore	O
algorithm	O
is	O
also	O
used	O
in	O
GNU	B-Operating_System
's	O
grep	B-Application
.	O
</s>
<s>
The	O
Boyer	B-Algorithm
–	I-Algorithm
Moore	I-Algorithm
–	I-Algorithm
Horspool	I-Algorithm
algorithm	I-Algorithm
is	O
a	O
simplification	O
of	O
the	O
Boyer	O
–	O
Moore	O
algorithm	O
using	O
only	O
the	O
bad	O
character	O
rule	O
.	O
</s>
<s>
The	O
Apostolico	B-Algorithm
–	I-Algorithm
Giancarlo	I-Algorithm
algorithm	I-Algorithm
speeds	O
up	O
the	O
process	O
of	O
checking	O
whether	O
a	O
match	O
has	O
occurred	O
at	O
the	O
given	O
alignment	O
by	O
skipping	O
explicit	O
character	O
comparisons	O
.	O
</s>
<s>
The	O
Raita	B-Algorithm
algorithm	I-Algorithm
improves	O
the	O
performance	O
of	O
Boyer-Moore-Horspool	B-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
The	O
searching	O
pattern	O
of	O
particular	O
sub-string	O
in	O
a	O
given	O
string	O
is	O
different	O
from	O
Boyer-Moore-Horspool	B-Algorithm
algorithm	I-Algorithm
.	O
</s>
