Smith–Waterman algorithm


Smith–Waterman algorithm
This local sequence alignment method explores all possible alignments and finds the optimal local alignment. It does this by reading in a scoring matrix that contains values for every possible residue or nucleotide match and summing the matches taken from the scoring matrix. Local alignment methods only report the best matching areas between two sequences - there may be a large number of alternative local alignments that do not score as highly.