Metraipolis › archive › dc_0deeb14d8ddc
Needleman–Wunsch algorithm — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T00:25:32.255Z
- SHA-256 of the archived text
354db5e453921c8e5f03b3cd4cb5a08649618542f3ee181cd2b49391349ab2c1- Stable URL of this page
https://metraipolis.com/documento/dc_0deeb14d8ddc
How to cite
Needleman–Wunsch algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_0deeb14d8ddc (Metraipolis archive dc_0deeb14d8ddc, sha256 354db5e453921c8e5f03b3cd4cb5a08649618542f3ee181cd2b49391349ab2c1)
BibTeX
@misc{dc0deeb14d8ddc,
title = {Needleman–Wunsch algorithm — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_0deeb14d8ddc; sha256 354db5e453921c8e5f03b3cd4cb5a08649618542f3ee181cd2b49391349ab2c1},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; ricerca «AI alignment»). Fonte: Wikipedia in inglese, voce «Needleman–Wunsch algorithm» — https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm Wikidata Q583546: «algorithm» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q583546 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1369642006, consultata il 2026-10-05T23:40:47.942Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: d127ed954357bb15e5b5a690a171bb91556eea302c6e7ffcc6c6cf000bde379e