distancePermutationHamming {CEGO} | R Documentation |
Hamming distance for permutations, scaled to values between 0 and 1. That is, the number of unequal elements of two permutations, divided by the permutations length.
distancePermutationHamming(x, y)
x |
first permutation (integer vector) |
y |
second permutation (integer vector) |
numeric distance value
d(x,y)
, scaled to values between 0 and 1 (based on the maximum possible distance between two permutations)
x <- 1:5 y <- c(5,1,2,3,4) distancePermutationHamming(x,y) p <- replicate(10,sample(1:5),simplify=FALSE) distanceMatrix(p,distancePermutationHamming)