Class Algorithm
java.lang.Object
pt.ist.phylolib.command.algorithm.Algorithm
- Direct Known Subclasses:
Edmonds,GloballyClosestPairs,GoeBURST,GoeBURSTFullMST,NeighbourJoining
Responsible for calculating a
phylogenetic tree from a
distance matrix.-
Nested Class Summary
Nested classes/interfaces inherited from interface pt.ist.phylolib.command.ICommand
ICommand.IGetter<T> -
Field Summary
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoidconfigureRequiredDistanceScope(Options options) Configures a scope that depends on user input before the matrix is loaded.Processes this command's input data into an output data.protected abstract TreeprocessImpl(Matrix matrix) Processes the matrix to create a phylogenetic tree.Declares the distance scope this algorithm needs.
-
Constructor Details
-
Algorithm
public Algorithm()
-
-
Method Details
-
requiredDistanceScope
Declares the distance scope this algorithm needs. Complete is the conservative default until an algorithm proves a bounded scope. -
configureRequiredDistanceScope
Configures a scope that depends on user input before the matrix is loaded. Most algorithms have a fixed requirement and do nothing here. -
process
Description copied from interface:ICommandProcesses this command's input data into an output data. -
processImpl
Processes the matrix to create a phylogenetic tree. Subclasses should implement their specific algorithm logic here.- Parameters:
matrix- the distance matrix- Returns:
- the computed phylogenetic tree
-