Insertions, deletions and substitutions between two strings

Given string A,B I need to compute the number o开发者_运维知识库f insertions, deletions and substitutions for B to become A. What would be a good algorithm for this?

That's known as Levenshtein distance.