Computer Science Question?
Computer Science Question?
We want to compute a longest common subsequence using the dynamic programming
approach discussed in the lecture notes, for X = ABCABCAB and Y = CABCABCA. Show all entries
of the dynamic programming table (i.e., a table similar to that of Fig. 15.8). Explicitly list the LCS you
found for X and Y.
Any help would be appreciated. Thanks in advance.
No Answers Posted Yet.