In Dynamic programming edit distance problem for 2 string how can we find the optimal edit sequence using the matrix
That's a good question. Did you have an example? What have you come up with so far?
