算法分析与设计2004春.课件.第03讲【荐】.pdfVIP

Lecture 3. Dynamic programming （continue ） • Longest common subsequence • Printing neatly • Edit distance • Optimal binary search tree • 技巧：Memoization[备忘录法] 清华大学宋斌恒 1 动态规划方法回顾 • 与分治方法有没有共同点？【不同点】 • 子问题空间？决定复杂性因子之一 • 子问题的治与合？复杂性因子之二 • 最优值 • 最优解 清华大学宋斌恒 2 Longest Common subsequence • Background: – In bioinformatics, it needs often to compare the DNA of two or more different organisms. – A strand of DNA consists of a string of molecules called base, where the possible bases are: • Adenine:腺嘌呤 • Guanine:鸟嘌呤 • Cytosine:胞核嘧啶, 氧氨嘧啶 • Thymine:胸腺嘧啶 – A DNA can be represented by a string over the finite set [A,C,G,T] 清华大学宋斌恒 3 Longest Common subsequence • Two possible DNA string; – S1 = ACCGGTCGAGTGCGCGGAAGCCGGCCGAA – S2 = GTCGTTCGGAATCGGCTTGCCGTTG • Our goal: Compare the two string to determine how “similar” the two strands are. • Issue: The similarity can be defined in many ways, here we use the “longest common subsequence” to describe the similarity 清华大学宋斌恒 4 Concepts • Subsequence and substring – A substring of a string is a continuous part of the string – A subsequence of a string x is a string y with its elements in y in the same order. 清华大学宋斌恒 5 一般的问题提法 • 有限字符集Σ、有限数量字符串A属于Σ* • 求最大公共子序列 • 具体参考所附资料《lcs991029.pdf》 清华大学宋斌恒 6 Longest Common subsequence problem • Given two sequences – X=x