## Longest common subsequence (Dynamic Programming)

Suppose we have a sequence of letters ACCGGTC. Then a subsequence of this sequence would be like ACCG or ACTC or CCC. To get ACTC, we pick letters 1, 2, 6, and 7. Formally, given a sequence X = x1, x2, . . . , xm, another sequence Z = [...]