in reply to Levenshtein distance: calculating similarity of strings

The next step is to work your way backwards through %mat to determine the best alignment of the two sequences. This is the Needleman/Wunsch algorithm. There is a good writeup on it, including diagrams, here
  • Comment on Re: Levenshtein distance: calculating similarity of strings