Review: Structure Of LCS Problem
l Observation 1: Optimal substructure
n Thus a simple recursive algorithm will suffice
n Subproblems: LCS of prefixes of x,y
l Observation 2: Overlapping subproblems
n Many recurring instances of each subproblem
n Unlike divide and conquer, where subproblems are
distinct