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

Packages that use PermutationDistanceMeasurerDouble

Package	Description
org.cicirello.permutations.distance	Implementations of a variety of permutation distance measures.

Uses of PermutationDistanceMeasurerDouble in org.cicirello.permutations.distance

Subinterfaces of PermutationDistanceMeasurerDouble in org.cicirello.permutations.distance

Modifier and Type	Interface	Description
interface	NormalizedPermutationDistanceMeasurer	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.
interface	NormalizedPermutationDistanceMeasurerDouble	Implement this interface to define a distance metric for permutations that supports normalizing the distance to the interval [0,1].
interface	PermutationDistanceMeasurer	Implement this interface, PermutationDistanceMeasurer, to define a distance metric for permutations.

Classes in org.cicirello.permutations.distance that implement PermutationDistanceMeasurerDouble

Modifier and Type	Class	Description
final class	AcyclicEdgeDistance	Acyclic edge distance treats the permutations as if they represent sets of edges, and counts the number of edges that differ.
class	BlockInterchangeDistance	Block Interchange Distance is the minimum number of block interchanges necessary to transform one permutation into the other.
final class	CycleDistance	Cycle distance is the count of the number of non-singleton permutation cycles between a pair of permutations.
final class	CycleEditDistance	Cycle edit distance is the minimum number of non-singleton permutation cycles necessary to transform permutation p1 into p2.
final class	CyclicEdgeDistance	Cyclic edge distance treats the permutations as if they represent sets of edges, and counts the number of edges that differ.
final class	CyclicIndependentDistance	This class implements the concept of a cyclic independent distance measure.
final class	CyclicIndependentDistanceDouble	This class implements the concept of a cyclic independent distance measure.
final class	CyclicReversalIndependentDistance	This class implements the combination of cyclic independence and reversal independence.
final class	CyclicReversalIndependentDistanceDouble	This class implements the combination of cyclic independence and reversal independence.
final class	CyclicRTypeDistance	Cyclic RType distance treats the permutations as if they represent sets of directed edges, and counts the number of edges that differ.
final class	DeviationDistance	Deviation distance is the sum of the positional deviation of the permutation elements.
final class	DeviationDistanceNormalized	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	DeviationDistanceNormalized2005	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	EditDistance	This is an implementation of Wagner and Fischer's dynamic programming algorithm for computing string edit distance, but adapted to permutations rather than general strings.
final class	ExactMatchDistance	Exact Match distance is an extension of Hamming distance but to non-binary strings, in this case, permutations.
final class	InterchangeDistance	Interchange distance is the minimum number of swaps necessary to transform one permutation into the other.
final class	KCycleDistance	K-Cycle distance is the count of the number of non-singleton permutation cycles of length at most K.
final class	KendallTauDistance	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	LeeDistance	Lee Distance is closely related to deviation distance.
final class	ReinsertionDistance	Reinsertion distance is the count of the number of removal/reinsertion operations needed to transform one permutation into the other.
final class	ReversalDistance	Reversal Distance is the minimum number of subpermutation reversals necessary to transform one permutation into the other.
final class	ReversalIndependentDistance	This class implements the concept of a reversal independent distance measure.
final class	ReversalIndependentDistanceDouble	This class implements the concept of a reversal independent distance measure.
final class	RTypeDistance	RType distance treats the permutations as if they represent sets of directed edges, and counts the number of edges that differ.
final class	ScrambleDistance	Scramble Distance is the minimum number of random shufflings needed to transform one permutation into the other.
final class	SquaredDeviationDistance	Squared Deviation distance is the sum of the squares of the positional deviations of the permutation elements.
final class	WeightedKendallTauDistance	This class implements the weighted Kendall tau distance.

Constructors in org.cicirello.permutations.distance with parameters of type PermutationDistanceMeasurerDouble

Modifier	Constructor	Description
	CyclicIndependentDistanceDouble(PermutationDistanceMeasurerDouble d)	Constructs a distance measure for measuring distance with cyclic independence, such that distance = min_{i in [0,N)} distance(p1,rotate(p2,i))
	CyclicReversalIndependentDistanceDouble(PermutationDistanceMeasurerDouble d)	Constructs a distance measure for measuring distance with cyclic and reversal independence, such that distance = min_{i in [0,N)} { distance(p1,rotate(p2,i)), distance(p1,rotate(reverse(p2),i)) }
	ReversalIndependentDistanceDouble(PermutationDistanceMeasurerDouble d)	Constructs a distance measure for measuring distance with reversal independence, such that distance = min { distance(p1,p2), distance(p1,reverse(p2)) }