华南理工大学-ACM-PC-4-Dynamic Programming.pptVIP

* Example: DP for CMM The optimal solution is ((A1(A2A3))((A4A5)A6) * Construct an Optimal Solution The final matrix multiplication in computing A1..n optimally is A1..s[1,n]As[1,n]+1..n. s[1,s[1,n]] determines the last matrix multiplication in computing A1..s[1,n] and s[s[1,n]+1,n] determines the last matrix multiplication in computing As[1,n]+1..n. Longest Common Subsequence In biological applications, we often want to compare the DNA of two (or more) different organisms. A strand of DNA consists of a string of molecules called bases, where the possible bases are adenine, guanin