Read on Wikipedia

Image: Slowkow · CC0

Needleman–Wunsch algorithm

Needleman–Wunsch algorithm

Method for aligning biological sequences.

Super rare
77 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

Super rareTop 12%

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 2,751

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 619 clicks on its links

  1. Smith–Waterman algorithm

    Algorithm for determining similar regions between two molecular sequences.

    24%

  2. Sequence alignment

    Process in bioinformatics that identifies equivalent sites within molecular sequences.

    20%

  3. Dynamic programming

    Problem optimization method.

    11%

  4. BLOSUM

    Bioinformatics tool.

    6.9%

  5. Point accepted mutation

    Type of similarity matrix in computational biology.

    5.8%

  6. Levenshtein distance

    String metric for measuring edit distance.

    2.4%

Readers come from

Share of the 749 readers arriving from another article

  1. Smith–Waterman algorithm

    Algorithm for determining similar regions between two molecular sequences.

    27%

  2. Sequence alignment

    Process in bioinformatics that identifies equivalent sites within molecular sequences.

    21%

  3. Dynamic time warping

    Algorithm for measuring similarity between temporal sequences.

    17%

  4. Levenshtein distance

    String metric for measuring edit distance.

    6.5%

  5. Approximate string matching

    Finding strings that approximately match a pattern.

    5.7%

  6. Hopper (microarchitecture)

    GPU microarchitecture designed by Nvidia.

    5.7%

  7. BLAST (biotechnology)

    Bioinformatics search algorithm.

    1.6%