[图文]算法分析(MIT教材) 英文版 .doc

Longest Common Subsequence (LCS Application: comparison of two DNA strings Ex: X= {A B C B D A B }, Y= {B D C A B A} Longest Common Subsequence: X= AB C BDAB Y= B D CAB A Brute force algorithm would