Needleman - Wunsch Algorithm
The Needleman–Wunsch Algorithm is a dynamic programming algorithm for global sequence alignment that guarantees an optimal alignment of two sequences by recursively computing alignment scores over all possible edit operations under a given scoring system.
75
Publications
6.1K
Citations
240
Authors
108
Institutions
Publications per year
2017–2026
21
75
1–5 of 75
240
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 240
108

University of Edinburgh
Edinburgh, United Kingdom
3 h-index
11 publications
559 citations
Los Alamos National Laboratory
Los Alamos, United States
2 h-index
3 publications
763 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
6 publications
3.2K citations
National Institutes of Health
Bethesda, United States
2 h-index
4 publications
225 citations
Collaboration for Australian Weather and Climate Research
Melbourne, Australia
2 h-index
2 publications
28 citations

Universidad Autónoma de Madrid
Madrid, Spain
2 h-index
6 publications
225 citations

Deakin University
Burwood, Australia
2 h-index
2 publications
28 citations

IT University of Copenhagen
Copenhagen, Denmark
2 h-index
3 publications
118 citations
1–8 of 108
6 publications · 1.3K citations
6
h-index
CABIOS · 6 publications · 398 citations
6
h-index
5 publications · 779 citations
5
h-index
3 publications · 397 citations
3
h-index
Repository · 2 publications · 29 citations
2
h-index
1–5