Needleman–Wunsch algorithm
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 assign
- Abstraction100002137
- Act100030358
- Activity100407535
- Algorithm105847438
- CausalAgent100007347
- Event100029378
- LivingThing100004258
- Object100002684
- Organism100004475
- Person100007846
- PhysicalEntity100001930
- Procedure101023820
- PsychologicalFeature100023100
- Rule105846932
- software
- Whole100003553
- WikicatAlgorithmsOnStrings
- WikicatBioinformaticsAlgorithms
- WikicatLivingPeople
- WikicatSequenceAlignmentAlgorithms
- YagoLegalActor
- YagoLegalActorGeo
- YagoPermanentlyLocatedEntity
- Caption
- enFigure 1: Needleman-Wunsch pairwise sequence alignment
- Class
- Sequence alignment
- Comment
- enThe 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 assign
- Depiction
- Has abstract
- enThe 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.
- Hypernym
- Algorithm
- Is primary topic of
- Needleman–Wunsch algorithm
- Label
- enNeedleman–Wunsch algorithm
- Link from a Wikipage to an external page
- web.archive.org/web/20091106224548/http:/svitsrv25.epfl.ch/R-doc/library/Biostrings/html/00Index.html
- alfehrest.org/sub/nwa/index.html
- zhanglab.ccmb.med.umich.edu/NW-align
- ds9a.nl/nwunsch
- technology66.blogspot.com/2008/08/sequence-alignment-techniques.html
- Link from a Wikipage to another Wikipage
- Algorithm
- Array data structure
- Bellman equation
- Bioinformatics
- BLOSUM
- Camera resectioning
- Category:Articles with example pseudocode
- Category:Bioinformatics algorithms
- Category:Computational phylogenetics
- Category:Dynamic programming
- Category:Sequence alignment algorithms
- Computer stereo vision
- Distortions
- DNA sequences
- Dynamic programming
- Dynamic time warping
- Gap penalty
- Hirschberg's algorithm
- Indel
- Levenshtein distance
- Matrix (mathematics)
- Method of Four Russians
- Michael J. Fischer
- Nucleotide
- Optimal matching
- Pixels
- Point accepted mutation
- Protein
- Real-time computing
- Recursion
- Scan lines
- Sequence alignment
- Sequence mining
- Similarity matrix
- Smith–Waterman algorithm
- String (computer science)
- Vladimir Levenshtein
- Wagner–Fischer algorithm
- SameAs
- 4mQ4s
- Algorisme de Needleman-Wunsch
- Algorithme de Needleman-Wunsch
- Algoritmo Needleman-Wunsch
- Algoritmo Needleman-Wunsch
- Algorytm Needlemana-Wunscha
- m.03ygxm
- Needlemanův–Wunschův algoritmus
- Needleman-Wunsch-Algorithmus
- Needleman-Wunsch algoritması
- Nidlmen-Vanšov algoritam
- Q583546
- Αλγόριθμος Νίντλμαν-Βουνς
- Алгоритм Нидлмана — Вунша
- Алгоритм Нідлмана — Вунша
- Нидлман–Вуншов алгоритам
- Նիդելման-Վունշի ալգորիթմ
- الگوریتم نیدلمن-وانچ
- ขั้นตอนวิธีของนีเดอมาน–วานซ์
- 尼德曼-翁施算法
- Subject
- Category:Articles with example pseudocode
- Category:Bioinformatics algorithms
- Category:Computational phylogenetics
- Category:Dynamic programming
- Category:Sequence alignment algorithms
- Thumbnail
- WasDerivedFrom
- Needleman–Wunsch algorithm?oldid=1121641668&ns=0
- WikiPageLength
- 25028
- Wikipage page ID
- 1004679
- Wikipage revision ID
- 1121641668
- WikiPageUsesTemplate
- Template:DNA sequence
- Template:External links
- Template:Infobox algorithm
- Template:Math
- Template:Mvar
- Template:Reflist
- Template:Short description
- Template:Strings
- Template:Technical