Computer Science Question?

Posted on 2014-04-04 08:51:00 in Management by SHANNON

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.

---

Answer Comment

No Answers Posted Yet.