to be the maximum V(·, c, i) value of all the partitions in Π(t, i), where t is a substring in Tj. To compute w(i, j) using dynamic programming method, we first consider the boundary values of w(i, j). We set w(0, j) = -∞ since we do not allow suf(tk-1tk, i) to be empty. Note that, by definition, i ≤ j.