All Classes and Interfaces

Class
Description
Implements common code for an Aligner which builds a score matrix during computation.
Implements common code for an Aligner for a pair of Sequences.
Implements common code for an Aligner for a pair of Profiles.
Implements common code for algorithms which compute a score.
Aligner<S extends Sequence<C>,C extends Compound>
Defines an algorithm which computes an alignment Profile from a list of Sequences.
Static utility to construct alignment routines from a common library of methods.
Compounds in query and target sequences that must align
 
Defines a 'cut' row for divide-and-conquer alignment in which a new anchor is found.
Define a traceback pointer for the three edit operations: substitution (match/replacement of a query compound with a target compound), deletion (removal of a query compound leaving a gap in the target sequence), and insertion (addition of a target compound opening a gap in the query sequence).
Alignment subproblem.
Static utility to easily run alignment routines.
List of implemented sequence pair in a profile scoring routines.
List of implemented pairwise sequence alignment routines.
List of implemented pairwise sequence scoring routines.
List of implemented profile-profile alignment routines.
List of implemented profile refinement routines.
This algorithm uses a divide-and-conquer approach to find optimal pairwise global sequence alignments (from the first until the last Compound of each Sequence) with the restriction that any alignment produced will connect the query sequence to the target sequence at the anchors.
Implements a concurrency wrapper for a PairwiseSequenceAligner.
Implements a concurrency wrapper for a PairwiseSequenceScorer.
Implements a concurrency wrapper for a ProfileProfileAligner.
This class provides static methods for the calculation of the percentage of identity between two aligned sequences.
 
 
This demo contains the CookBook example to create a phylogenetic tree from a multiple sequence alignment (MSA).
 
The DistanceMatrixCalculator methods generate a DistanceMatrix from a MultipleSequenceAlignment or other indirect distance infomation (RMSD).
Check the accuracy of a Distance Tree by least squares error (LSE) of the Tree branch lengths and the original Distance Matrix.
This class contains wrapper methods for communication between BioJava and forester (e.g, Data Structure conversion).
Implements an algorithm which computes a score for a sequence alignment pair picked from an alignment Profile.
Implements an algorithm which computes a score for a sequence alignment pair.
Implements an algorithm which computes a score for a sequence alignment pair picked from an alignment Profile.
Implements an algorithm which computes a score for a sequence alignment pair.
Defines a data structure for the gap penalties used during a sequence alignment routine.
Defines the possible types of gap penalties.
GuanUberbacher<S extends Sequence<C>,C extends Compound>
Guan and Uberbacher defined an algorithm for pairwise global sequence alignments (from the first until the last Compound of each Sequence).
GuideTree<S extends Sequence<C>,C extends Compound>
Implements a data structure for a guide tree used during progressive multiple sequence alignment.
GuideTreeNode<S extends Sequence<C>,C extends Compound>
Defines a data structure for the node in a guide tree used during progressive multiple sequence alignment.
Defines a clustering algorithm that converts a distance matrix into a tree.
MatrixAligner<S extends Sequence<C>,C extends Compound>
Defines an Aligner which builds a score matrix during computation.
NeedlemanWunsch<S extends Sequence<C>,C extends Compound>
Needleman and Wunsch defined an algorithm for pairwise global sequence alignments (from the first until the last Compound of each Sequence).
Defines an algorithm which computes a score for a sequence alignment pair picked from an alignment Profile.
Defines an Aligner for a pair of Sequences.
Defines an algorithm which computes a score for a pair of sequences.
Defines an algorithm which computes a new alignment Profile by splitting a current alignment and realigning.
Defines an Aligner for a pair of Profiles.
Defines an algorithm which computes a score for a pairing of alignment profiles.
RescoreRefiner<S extends Sequence<C>,C extends Compound>
Defines an algorithm which computes a new alignment Profile by rescoring all pairs in an alignment and realigning.
Defines an algorithm which computes a score.
Implements a data structure for the gap penalties used during a sequence alignment routine.
Implements a simple (naive) Aligner for a pair of Profiles.
SmithWaterman<S extends Sequence<C>,C extends Compound>
Smith and Waterman defined an algorithm for pairwise local sequence alignments (best match of sections from each Sequence).
 
Stores all the content parsed from the #=GF lines
 
Stores all the content of a Stockholm file.
 
Scores using a substitution matrix.
 
The TreeConstructor uses the forester library to build different types of phylogenetic trees.
The TreeConstructorType specifies the aligorithm used to construct the tree (clustering algorithm).
The TreeType specifies the optimization criteria used to generate the tree.