DP
For i:= 0 to n do D[i,0] = i
for j:= 0 to m do D[0,j] = j;
For i := 1 to n
for j := 1 to m
D[i,j] = min( D[i-1,j-1] + matchcost(P[i],T[j]),
D[i-1,j] + 1, D[i,j-1] + 1)
Previous slide
Next slide
Back to first slide
View graphic version