Remember Me to One Who Lives There
One application of dynamic programming is finding the longest common subsequence of two strings. Greg’s example from class applied this principle to sequences of DNA, where it can indicate mutations. I thought it might be interesting to try this with…