... := to m Li,0 := for j := to n L0,j := len := answer := for i := to m for j := to n if Ai ≠ Bj then Li,j := else Li,j := + Li-1,j-1 if Li,j > len then len := Li,j answer = Example: ... COMMON SUBSEQUENCE(A,m,B,n) i := to m Li,0 := j := to n L0,j := i := to m for j := to n if Ai = Bj then Li,j := + Li-1,j-1 else Li,j := Max{ Li-1,j, Li,j-1} length := Lm,n Dan Hirschberg Computer ... k < j { mi,k + mk+1,j + ri-1rkrj }, if i < j The algorithm: for i := to n mi,i := for length := to n-1 for i := to n-length j := i + length mi,j = MINi≤k...