Hamming distance: d_H(x,y) = #{i: x_i ≠ y_i}; upper-bounds Levenshtein

Layer 3 — Biologyin the computational-biology subtree

Hamming distance (Hamming 1950, in the context of error-correcting codes) counts the positions at which two equal-length strings differ. Formally: d_H(x, y) = Σ_i 1[x_i ≠ y_i] for |x| = |y|, undefined otherwise. Metric-space properties…

Related concepts

Explore Hamming distance: d_H(x,y) = #{i: x_i ≠ y_i}; upper-bounds Levenshtein on the interactive knowledge graph →