To do Dynamic Programming: First write one sequence across the top, and one down along the side 2 5 Gap V D 0 Gap -8-16-24 32-40 2 E So scoring Sij requires that we know S(i-1, j-1) and S(i, j-1) and S(i-1,j 3 S 24 Therefore recursive, we use the solutions Of smaller problems to solve larger ones 32 ANd we store how we got to the sij score i e, the intermediate solutions in a tabular 40 matrix. Computer scientists call this dynamic programming where"programming means 18 the matrix, not some kind of computer code1 2 3 4 5 6 To do Dynamic Programming: First write one sequence across the top, and one down along the side i =0 1 2 3 4 5 j = Gap V D S C Y 0 Gap 0 sij -8 -16 -24 -32 -40 V -8 E -16 So scoring Sij requires that we know S(i-1, j-1) and S(i, j-1) and S(i-1, j)… S -24 Therefore recursive. We use the solutions Of smaller problems to solve larger ones. L -32 AND we store how we got to the Sij score, i.e. the intermediate solutions in a tabular C -40 matrix. Computer scientists call this dynamic programming, where “programming” means Y -48 the matrix, not some kind of computer code