Needleman-wunsch Algorithm
The Needleman-Wunsch Algorithm is a dynamic programming algorithm for global pairwise sequence alignment that guarantees an optimal alignment by maximizing a similarity score through the systematic comparison of all possible alignments.
79
Publications
6.3K
Citations
245
Authors
113
Institutions
Publications per year
2017–2026
22
79
1–5 of 79
245
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 245
113

University of Edinburgh
Edinburgh, United Kingdom
3 h-index
11 publications
559 citations
PSG INSTITUTE OF TECHNOLOGY AND APPLIED RESEARCH
Coimbatore, India
2 h-index
4 publications
116 citations

IT University of Copenhagen
Copenhagen, Denmark
2 h-index
3 publications
118 citations

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

Universidad Autónoma de Madrid
Madrid, Spain
2 h-index
6 publications
225 citations
Swinburne University of Technology
Melbourne, Australia
2 h-index
6 publications
84 citations

University of British Columbia
Vancouver, Canada
2 h-index
2 publications
24 citations
Los Alamos National Laboratory
Los Alamos, United States
2 h-index
3 publications
763 citations
1–8 of 113
7 publications · 1.5K citations
7
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 · 3 publications · 176 citations
3
h-index
1–5