in reply to Hamming Distance Between 2 Strings - Fast(est) Way?

Check Out Text::LevenshteinXS

Replies are listed 'Best First'.
Re^2: Hamming Distance Between 2 Strings - Fast(est) Way?
by monkfan (Curate) on Oct 21, 2005 at 10:31 UTC
    Dear NateTut,
    This module doesn't compute the exact Hamming Distance as I required.
    Instead it returns edit distance. Here is the example: 
    perl -MText::LevenshteinXS -e '
$s1 = 'GGAAG'; 
$s2 = 'GAAGA'; 
$diff = distance($s1,$s2); 
print "$diff\n";'

    [download]
    It prints: 2 instead of 3.

    Regards,
    Edward
[reply]
[d/l]

In Section Seekers of Perl Wisdom