Insertions, deletions and substitutions between two strings

Question

Given string A,B I need to compute the number of insertions, deletions and substitutions for B to become A. What would be a good algorithm for this?

Answer 1

That's known as Levenshtein distance.