Needleman-Wunsch algorithm
a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
Click one of the letters above to advance the page to terms beginning with that letter.
- Needleman-Wunsch algorithm search for term
Algorithm that performs a global alignment on two sequences. It is commonly used in bioinformatics to align protein or nucleotide sequences. The algorithm was published in 1970 by Saul B. Needleman and Christian D. Wunsch. The Needleman-Wunsch algorithm is an example of dynamic programming, and was the first application of dynamic programming to biological sequence comparison. Scores for aligned characters are specified by a similarity matrix. (Wikipedia)
