Hamming Distance Calculator
Calculate Hamming distance between strings
Frequently Asked Questions
What is Hamming distance?
Hamming distance measures the number of positions where corresponding symbols differ between two strings of equal length. For binary strings 1011101 and 1001001, the Hamming distance is 2 (positions 3 and 5 differ).
How is Hamming distance used in error detection?
In telecommunications, Hamming distance determines a code's error-detecting capability. A code with minimum Hamming distance d can detect up to d-1 errors and correct up to ⌊(d-1)/2⌋ errors. Hamming(7,4) code corrects single-bit errors.
Can Hamming distance compare text strings?
Yes, for strings of equal length. Comparing "karolin" and "kathrin": differences at positions 2(a/t), 3(r/h), 4(o/r), 5(l/i) give a Hamming distance of 4. It is case-sensitive by default.
What is the difference between Hamming and Levenshtein distance?
Hamming distance only counts substitutions and requires equal-length strings. Levenshtein distance also counts insertions and deletions, working with strings of any length. Hamming is faster but more restrictive.
How is Hamming distance used in DNA analysis?
In bioinformatics, Hamming distance measures mutations between DNA sequences of equal length. Comparing GAGCCTACTAACGGGAT and CATCGTAATGACGGCCT gives the number of point mutations between the two sequences.