Boyer-Moore Algorithm


\begin{algorithm} {Boyer-Moore-Matcher}{T,P,\Sigma} n \= \mbox{length[T]}\ m ... ...+\ {\rm max}(\gamma[j], j-\lambda[T[s+j]]) \end{IF} \end{WHILE} \end{algorithm}

Heuristics must have the property that they don't miss any matches.

next up previous
Next: Bad-Character Heuristic Up: BOYER-MOORE Previous: Naive Algorithm Again