- Type Parameters:
S- eachSequencein the tree is of type SC- each element of aSequenceis aCompoundof type C
public interface HierarchicalClusterer<S extends Sequence<C>,C extends Compound>
Defines a clustering algorithm that converts a distance matrix into a tree.
- Author:
- Mark Chapman
-
Method Summary
Modifier and TypeMethodDescriptionfloat[][]Returns the distance matrix used in clustering.getRoot()Returns the root node of the tree resulting from this clustering algorithm.
-
Method Details
-
getDistanceMatrix
float[][] getDistanceMatrix()Returns the distance matrix used in clustering. May be calculated from another original source.- Returns:
- the distance matrix input to clustering
-
getRoot
GuideTreeNode<S,C> getRoot()Returns the root node of the tree resulting from this clustering algorithm.- Returns:
- the resulting tree output from clustering
-