It prints: 2 instead of 3.perl -MText::LevenshteinXS -e ' $s1 = 'GGAAG'; $s2 = 'GAAGA'; $diff = distance($s1,$s2); print "$diff\n";'
In reply to Re^2: Hamming Distance Between 2 Strings - Fast(est) Way?
by monkfan
in thread Hamming Distance Between 2 Strings - Fast(est) Way?
by monkfan
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |