15
Pattern Matching
(cont)
Given two strings
T
(
text
) and
P
(
pattern
),
the
pattern matching problem
consists of finding a substring of
T
equal to
P
Applications:
Text editors
Search engines
Biological research
![[prev]](icon/prev.gif){kind=icon}
15
![[next]](icon/next.gif){kind=icon}