Editing Boyer–Moore string-search algorithm (section)

==Variants==
The [[Boyer–Moore–Horspool algorithm]] is a simplification of the Boyer–Moore algorithm using only the bad-character rule.

The [[Apostolico–Giancarlo algorithm]] speeds up the process of checking whether a match has occurred at the given alignment by skipping explicit character comparisons. This uses information gleaned during the pre-processing of the pattern in conjunction with suffix match lengths recorded at each match attempt. Storing suffix match lengths requires an additional table equal in size to the text being searched.

The [[Raita algorithm]] improves the performance of Boyer–Moore–Horspool algorithm. The searching pattern of particular sub-string in a given string is different from Boyer–Moore–Horspool algorithm.