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

Authors

240

  1. SV
    Steve Versteeg

    Swinburne University of Technology, Australia

    2 publications · 28 citations

    2

    h-index

  2. AB
    A. Benkrid

    Queen's University Belfast, United Kingdom

    2 publications · 148 citations

    2

    h-index

  3. JG
    John Grundy

    Monash University, Australia

    2 publications · 28 citations

    2

    h-index

  4. DR
    David Rozado

    Otago Polytechnic, New Zealand

    2 publications · 75 citations

    2

    h-index

  5. MG
    Menka Goyal

    Swinburne University of Technology, Australia

    2 publications · 28 citations

    2

    h-index

1–5 of 240

Venues

  1. BMC Bioinformatics

    6 publications · 1.3K citations

    6

    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 · 2 publications · 29 citations

    2

    h-index

1–5