distancePermutationLCStr: Longest Common Substring Distance for Permutations

In CEGO: Combinatorial Efficient Global Optimization

Longest Common Substring Distance for Permutations

Description

Distance of permutations. Based on the longest string of adjacent elements that two permutations have in common.

Usage

distancePermutationLCStr(x, y)

Arguments

x	first permutation (integer vector)
y	second permutation (integer vector) #' @return numeric distance value d(x,y) , scaled to values between 0 and 1 (based on the maximum possible distance between two permutations)

References

Hirschberg, Daniel S. "A linear space algorithm for computing maximal common subsequences." Communications of the ACM 18.6 (1975): 341-343.

Examples

x <- 1:5
y <- c(5,1,2,3,4)
distancePermutationLCStr(x,y)
p <- replicate(10,sample(1:5),simplify=FALSE)
distanceMatrix(p,distancePermutationLCStr)

CEGO documentation built on May 29, 2024, 3:35 a.m.