Substring

From Freepedia

A substring of a string <math>T = t_1 t_2 \dots t_n</math> is a string <math>P = p_1 p_2 \dots p_m</math> such that <math>t_{1+i} \dots t_{m+i} = p_{1} \dots p_{m}</math>.

T = BANANA
     |||
P =  ANA

Given a pattern P, you can find its occurrences in a string T with a String searching algorithm.