Let X and Y be strings of length n and m, respectively. Define B(j,k) to be the

Question:

Let X and Y be strings of length n and m, respectively. Define B(j,k) to be the length of the longest common substring of the suffix X[n− j..n−1] and the suffix Y[m−k..m−1]. Design an O(nm)-time algorithm for computing all the values of B( j,k) for j = 1, . . . ,n and k = 1, . . . ,m.

Fantastic news! We've Found the answer you've been seeking!