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

Authors

245

  1. FB
    Francisco B. Rodrı́guez

    Universidad Autónoma de Madrid, Spain

    2 publications · 75 citations

    2

    h-index

  2. CB
    Christian Brzinsky-Fay

    WZB Berlin Social Science Center, Germany

    2 publications · 385 citations

    2

    h-index

  3. JH
    Jun Han

    Swinburne University of Technology, Australia

    2 publications · 28 citations

    2

    h-index

  4. UK
    Ulrich Köhler

    Leibniz University Hannover, Germany

    2 publications · 385 citations

    2

    h-index

  5. MA
    Mahmoud Al‐Ayyoub

    Jordan University of Science and Technology, Jordan

    2 publications · 77 citations

    2

    h-index

1–5 of 245

Venues

  1. BMC Bioinformatics

    7 publications · 1.5K citations

    7

    h-index

  2. Computer applications in the biosciences

    CABIOS · 6 publications · 398 citations

    6

    h-index

  3. Nucleic Acids Research

    5 publications · 779 citations

    5

    h-index

  4. Bioinformatics

    3 publications · 397 citations

    3

    h-index

  5. arXiv (Cornell University)

    Repository · 3 publications · 176 citations

    3

    h-index

1–5