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

Packages that use NormalizedPermutationDistanceMeasurer

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

Uses of NormalizedPermutationDistanceMeasurer in org.cicirello.permutations.distance

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

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	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	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	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.