Boyer–Moore string-search algorithm

E347189 UNEXPLORED

The Boyer–Moore string-search algorithm is a highly efficient pattern-matching algorithm that scans text from right to left and uses precomputed shift rules to skip sections of the text, making it one of the fastest practical algorithms for substring search.

Jump to: Surface forms Referenced by

Observed surface forms (1)

Surface form	Occurrences
Boyer–Moore algorithm	1

Referenced by (3)

Full triples — surface form annotated when it differs from this entity's canonical label.

J Strother Moore → coInventorOf → Boyer–Moore string-search algorithm ⓘ

Knuth–Morris–Pratt algorithm → comparedWith → Boyer–Moore string-search algorithm ⓘ

this entity surface form: Boyer–Moore algorithm

J Strother Moore → knownFor → Boyer–Moore string-search algorithm ⓘ