Needleman-Wunsch Sequence Alignment Algorithm

From GM-RKB
(Redirected from Needleman-Wunsch algorithm)
Jump to navigation Jump to search

A Needleman-Wunsch Sequence Alignment Algorithm is a global sequence alignment algorithm that aligns two complete sequences.



References

2021a

  • (Wikipedia, 2021) ⇒ https://en.wikipedia.org/wiki/Needleman–Wunsch_algorithm Retrieved:2021-2-24.
    • The Needleman–Wunsch algorithm is an algorithm used in bioinformatics to align protein or nucleotide sequences. It was one of the first applications of dynamic programming to compare biological sequences. The algorithm was developed by Saul B. Needleman and Christian D. Wunsch and published in 1970. The algorithm essentially divides a large problem (e.g. the full sequence) into a series of smaller problems, and it uses the solutions to the smaller problems to find an optimal solution to the larger problem. It is also sometimes referred to as the optimal matching algorithm and the global alignment technique. The Needleman–Wunsch algorithm is still widely used for optimal global alignment, particularly when the quality of the global alignment is of the utmost importance. The algorithm assigns a score to every possible alignment, and the purpose of the algorithm is to find all possible alignments having the highest score.

2021b

1970