Search Java Classes and Packages
Search Java Frameworks and Libraries
#Org.biojava.nbio.alignment.routines Classes and Interfaces - 8 results found.
Name | Description | Type | Package | Framework |
AlignerHelper | Static utility to construct alignment routines from a common library of methods. | Class | org.biojava.nbio.alignment.routines | BioJava |
|
AlignerHelper .Anchor | Compounds in query and target sequences that must alignAuthor:Daniel Cameron | Class | org.biojava.nbio.alignment.routines | BioJava |
|
AlignerHelper .Anchor .QueryIndexComparator | | Class | org.biojava.nbio.alignment.routines | BioJava |
|
AlignerHelper .Cut | Defines a 'cut' row for divide-and-conquer alignment in which a new anchor is found. | Class | org.biojava.nbio.alignment.routines | BioJava |
|
AlignerHelper .Last | 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 | Class | org.biojava.nbio.alignment.routines | BioJava |
|
AlignerHelper .Subproblem | Alignment subproblem. | Class | org.biojava.nbio.alignment.routines | BioJava |
|
AnchoredPairwiseSequenceAligner | 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 | Class | org.biojava.nbio.alignment.routines | BioJava |
|
GuanUberbacher | Guan and Uberbacher defined an algorithm for pairwise global sequence alignments (from the first until the last Compound of each Sequence). | Class | org.biojava.nbio.alignment.routines | BioJava |