Module org.cicirello.jpt

Package org.cicirello.sequences.distance

package org.cicirello.sequences.distance
Implementations of distance measures for general sequences of various forms, including Strings, arrays of primitive types, arrays of objects, etc.
  • Class
    Description
    EditDistance
    EditDistance is an implementation of Wagner and Fischer's dynamic programming algorithm for computing string edit distance.
    EditDistanceDouble
    EditDistanceDouble is an implementation of Wagner and Fischer's dynamic programming algorithm for computing string edit distance.
    ExactMatchDistance
    ExactMatch distance (or Hamming Distance) of a pair of non-binary strings (or more generally sequences) is the number of sequence (or string) positions where the two sequences differ.
    KendallTauSequenceDistance
    Kendall Tau Sequence Distance is the minimum number of adjacent swaps necessary to transform one sequence into the other.
    LongestCommonSubsequenceDistance
    LongestCommonSubsequenceDistance is a form of EditDistance, where the edit operations are limited to deletions and insertions (i.e., no replacements or changes), and where the cost of an edit operation is simply 1.
    SequenceDistanceMeasurer
    Implement this interface, SequenceDistanceMeasurer, to define a distance metric for sequences.
    SequenceDistanceMeasurerDouble
    Implement this interface, SequenceDistanceMeasurerDouble, to define a distance metric for sequences.