Gene Mon, 23 Jan 2006 20:03:19 -0800
LCS(X, Y) = the longest string over i =1..|X| and j=1..|Y| where X[i]=Y[j] given by LCS(X[1..i-1], Y[1..j-1]) + X[i] + LCS(X[i+1..|X|], Y[j+1..|Y|]
