Find a longest common subsequence of the given sequence. Show the c table computed by the algorithm for computing the length of a longest common subsequence.

SLWOVNNDK, KDNNVOWLS

Algorithm for Computing the Length of a Longest Common Subsequence: This dynamic-programming algorithm computes the length c[i][j] of a longest common subsequence of a[1],...,a[i] and b[1],...,b[j] for i=0,...,m and j=0,...,n.

Input Parameters: a,b Output Parameters: c

LCS(a,b,c) { m = a.last n = b.last for i = 0 to m c[i][0] = 0 for j = 1 to n c[0][j] = 0 for i = 1 to m for j = 1 to n if (a[i] != b[j]) c[i][j] = max(c[i-1][j], c[i][j-1]) else c[i][j] = 1 + c[i-1][j-1] }