kleytonmr/levenshtein

Algorithm Levenshtein distance or edit the distance between two "strings" (two chains) the minimum number of operations required to transform one chain into another.

Python