hamming: Hamming distance
In abdiv: Alpha and Beta Diversity Measures

The Hamming distance is the number of positions where the values are different.

1	hamming(x, y)

x, y

Numeric vectors.

For vectors x and y, the Hamming distance is defined as

d(x, y) = ∑_i [x_i \neq y_i],

where the quantity in the brackets is 1 if the elements are not equal, and zero if the elements are equal. Relation to other definitions:

The hamming() function in scipy.spatial.distance divides the result by the vector length. Our function is equivalent to the SciPy version multiplied by the vector length.
Equivalent to the hamming calculator in Mothur for presence/absence vectors.

The Hamming distance between x and y.

abdiv documentation built on Jan. 20, 2020, 5:07 p.m.