Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
PerlMonks  

Re^2: Hamming Distance Between 2 Strings - Fast(est) Way?

by monkfan (Curate)
on Oct 21, 2005 at 10:31 UTC ( #501948=note: print w/replies, xml ) Need Help??


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

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";'
It prints: 2 instead of 3.

Regards,
Edward

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://501948]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (4)
As of 2020-11-27 02:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?