Needleman-Wunsch algorithm


Needleman-Wunsch algorithm
This global sequence alignment method – the first to apply dynamic programming techniques to biological sequence analysis – explores all possible alignments and choose the best one (the optimal global alignment). It does this by reading in a scoring matrix and a gap penalty (penalties) that contains values for every possible residue or nucleotide match and summing the matches taken from the scoring matrix.