Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?
 
PerlMonks  

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

by NateTut (Deacon)
on Oct 14, 2005 at 10:39 UTC ( #500237=note: print w/replies, xml ) Need Help??


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 06: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";'
    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://500237]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (5)
As of 2020-11-27 17:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?