Uses of Interface
org.cicirello.permutations.distance.NormalizedPermutationDistanceMeasurerDouble

Package
Description
Implementations of a variety of permutation distance measures.
  • Uses of NormalizedPermutationDistanceMeasurerDouble in org.cicirello.permutations.distance

    Modifier and Type
    Interface
    Description
    interface 
    Implement this interface to define a distance metric for permutations that supports normalizing the distance to the interval [0,1], but where the base distance is an integer value.
    Modifier and Type
    Class
    Description
    final class 
    Acyclic edge distance treats the permutations as if they represent sets of edges, and counts the number of edges that differ.
    class 
    Block Interchange Distance is the minimum number of block interchanges necessary to transform one permutation into the other.
    final class 
    Cycle distance is the count of the number of non-singleton permutation cycles between a pair of permutations.
    final class 
    Cycle edit distance is the minimum number of non-singleton permutation cycles necessary to transform permutation p1 into p2.
    final class 
    Cyclic edge distance treats the permutations as if they represent sets of edges, and counts the number of edges that differ.
    final class 
    Cyclic RType distance treats the permutations as if they represent sets of directed edges, and counts the number of edges that differ.
    final class 
    Deviation distance is the sum of the positional deviation of the permutation elements.
    final class 
    Normalized Deviation distance is the sum of the positional deviation of the permutation elements divided by N-1 (where N is the length of the permutation).
    final class 
    The original version of Normalized Deviation distance (Ronald, 1998) is the sum of the positional deviation of the permutation elements divided by N-1 (where N is the length of the permutation).
    final class 
    Exact Match distance is an extension of Hamming distance but to non-binary strings, in this case, permutations.
    final class 
    Interchange distance is the minimum number of swaps necessary to transform one permutation into the other.
    final class 
    K-Cycle distance is the count of the number of non-singleton permutation cycles of length at most K.
    final class 
    Kendall Tau distance is sometimes also known as bubble sort distance, as it is the number of adjacent swaps necessary to transform one permutation into the other.
    final class 
    Lee Distance is closely related to deviation distance.
    final class 
    Reinsertion distance is the count of the number of removal/reinsertion operations needed to transform one permutation into the other.
    final class 
    Reversal Distance is the minimum number of subpermutation reversals necessary to transform one permutation into the other.
    final class 
    RType distance treats the permutations as if they represent sets of directed edges, and counts the number of edges that differ.
    final class 
    Scramble Distance is the minimum number of random shufflings needed to transform one permutation into the other.
    final class 
    Squared Deviation distance is the sum of the squares of the positional deviations of the permutation elements.
    final class 
    This class implements the weighted Kendall tau distance.