Dynamic Programming
Longest Common Subsequence Definition: The longest common subsequence or LCS of two strings S1 and S2 is the longest subsequence common between two strings.
Review: Dynamic Programming Dynamic programming is another strategy for designing algorithms Use when problem breaks down into recurring small subproblems.
Simple and fast linear space computation of Longest common subsequences Claus Rick, 1999.
CSC 413/513: Intro to Algorithms Greedy Algorithms.
