麻省理工学院算法导论lecture (15).pdfVIP

Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 15 Prof. Charles E. Leiserson Dynamic programming Design technique, like divide-and-conquer. Example: Longest Common Subsequence (LCS) • Given two sequences x [1 . . m] and y [1 . . n], find a longest subsequence common to them both. “a” not “the” x : A B C B D A B BCBA = LCS(x , y ) y : B D C A B A functional notation, but not a function © 2001 by Charles E. Leiserson© 2001 by Charles E. Leiserson Introduction to Algorithms Day 26 L15.2 Brute-force LCS algorithm Check every subsequence of x [1 . . m] to see if it is also a subsequence of y [1 . . n]. Analysis • Checking = O(n) time per subsequence. • 2m subsequences of x (each bit-vector of length m determines a distinct subsequence of x). Worst-case running time = O(n2m) = exponential time. © 2001 by Charles E. Leiserson© 2001 by Charles E. Leiserson Introduction to Algorithms Day 26 L15.3 Towards a better algorithm Simplification: 1. Look at the length of a longest-common subsequence. 2. Extend the algorithm to find the LCS itself. Notation: Denote the length of a sequence s by |s |. Strategy: Consider prefixes of x and y . • Define c[i,j ] = | LCS(x [1 . . i], y [1 . .j ]) |. • Then, c[m, n] = | LCS(x , y ) |. © 2001 by Charles E. Leiserson© 2001 by Charles E. Leiserson Introduction to Algorithms Day 26 L15.4 Recursive formulation Theorem. c[i–1, j –1] + 1