Good-Suffix Heuristic

Propose to shift the pattern to the right by the least amount that guarantees not to skip any occurrence of the good-suffix already matched.

T = abbbaabab
           ||
P =    cabaab
P =       cabaab

$\gamma[j] = m - \mbox{max}\{k:0 \le k < m\ \mbox{and}\ P[j+1..m]\sim P_k\}$. In example above, j = 4, want maximum k such that $P[5..6]=\mbox{\tt ab} \sim P_k$.

So, $\gamma[4] = 3$.