25
Exercise #3: Boyer-Moore algorithm
For the alphabet Σ = {
a,b,c,d
}
compute last-occurrence function
L
for pattern
P
=
abacab
trace Boyer-More on
P
and text
T
=
abacaabadcabacabaabb
how many comparisons are needed?
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}