Applications - Contd

Applications - Contd

A Dynamic Programming algorithm can be

used to compute edit distance.

Let D[i,j] be the edit distance between

x_1,…x_i and y_1,…,y_j.

D[i,j]= min{ D[i-1,j-1]+replac(x_i,y_j),

D[i-1,j]+1,D[i,j-1]+1}

Previous slide

Next slide

Back to the first slide

View Graphic Version