|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use NeedlemanWunsch | |
---|---|
org.biojava.bio.alignment | Classes to generate and describe sequence alignments. |
Uses of NeedlemanWunsch in org.biojava.bio.alignment |
---|
Subclasses of NeedlemanWunsch in org.biojava.bio.alignment | |
---|---|
class |
SmithWaterman
Smith and Waterman developed an efficient dynamic programming algorithm to perform local sequence alignments, which returns the most conserved region of two sequences (longest common substring with modifications). |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |