tailieunhanh - Advanced Algorithms Analysis and Design - Lecture 23: Longest common subsequence (Dynamic algorithm) & Optimal binary search trees

Advanced Algorithms Analysis and Design - Lecture 23: Longest common subsequence (Dynamic algorithm) & Optimal binary search trees. In this lecture we will cover the following: optimal substructure of an LCS; computable tables; longest common subsequence algorithm; construction of longest common subsequence; relationship with shortest common supper-sequence; . |