I have two equal length strings containing 1's and 0's. Each string is 128-bits long, and I want to calculate the Hamming distance between them. What's the best way I can go about doing this?
e.g. a='1000001' and b='1110001' --> dist=Hamming(a,b);
Asked
Active
Viewed 1.3k times
2 Answers
6
-
2Only thing to note is that this gives a fractional result, which is nonstandard. You'll need to multiply the result by `length(a)`. – Oliver Charlesworth Nov 14 '10 at 20:38
-
You also need to turn 1000001 into [1 0 0 0 0 0 0 1] in order to let pdist treat each digit separately – Code42 Sep 03 '17 at 04:36
5
dist = sum(a ~= b);
Oliver Charlesworth
- 267,707
- 33
- 569
- 680
-
Your solution is incorrect. Take dist = sum(4 ~= 8) produces 1, where in fact 0100 and 1000 have hamming distance 2. – Gustavo Litovsky Jan 15 '13 at 17:16
-
@GustavoLitovsky: You missed that the OP has strings of bits, not integers. – Oliver Charlesworth Jan 15 '13 at 17:31