17
Analysis of Naive Pattern Matching
Naive pattern matching runs in O(n·m)
Examples of worst case (forward checking):
T
=
aaa…ah
P
=
aaah
may occur in DNA sequences
unlikely in English text
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}