Smith - Waterman Algorithm

The Smith - Waterman Algorithm is a dynamic programming algorithm for performing local sequence alignment in biological sequences, distinguished from global alignment methods by identifying optimally matching subsequences through the use of zero-score boundaries that allow alignment to restart at mismatches.

296

Publications

44.9K

Citations

864

Authors

343

Institutions

Publications per year

2017–2026

42

Variants

Smith-waterman Algorithm

Authors

864

  1. BS
    Bertil Schmidt

    Johannes Gutenberg University Mainz, Germany

    14 publications · 1.3K citations

    13

    h-index

  2. AC
    Alba Cristina Magalhães Alves de Melo

    Universidade de Brasília, Brazil

    8 publications · 341 citations

    8

    h-index

  3. ZA
    Zaid Al-Ars

    Delft University of Technology, Netherlands

    7 publications · 215 citations

    7

    h-index

  4. WL
    Weiguo Liu

    Shandong University, China

    6 publications · 227 citations

    6

    h-index

  5. KB
    Koen Bertels

    Delft University of Technology, Netherlands

    6 publications · 198 citations

    6

    h-index

1–5 of 864

Venues

  1. Bioinformatics

    32 publications · 16.3K citations

    24

    h-index

  2. BMC Bioinformatics

    24 publications · 2.2K citations

    20

    h-index

  3. Nucleic Acids Research

    14 publications · 6.1K citations

    14

    h-index

  4. Computer applications in the biosciences

    CABIOS · 7 publications · 313 citations

    7

    h-index

  5. PubMed

    Repository · 6 publications · 387 citations

    6

    h-index

1–5