Read on Wikipedia

Image: Yz cs5160 · CC BY-SA 4.0

Smith–Waterman algorithm

Smith–Waterman algorithm

Algorithm for determining similar regions between two molecular sequences.

Super rare
67 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,290

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 411 clicks on its links

  1. Needleman–Wunsch algorithm

    Method for aligning biological sequences.

    49%

  2. Sequence alignment

    Process in bioinformatics that identifies equivalent sites within molecular sequences.

    18%

  3. Michael Waterman

    American mathematician.

    14%

  4. Temple F. Smith

    American academic.

    8.5%

  5. Dynamic programming

    Problem optimization method.

    4.9%

  6. BLAST (biotechnology)

    Bioinformatics search algorithm.

    3.6%

Readers come from

Share of the 540 readers arriving from another article

  1. Needleman–Wunsch algorithm

    Method for aligning biological sequences.

    28%

  2. Sequence alignment

    Process in bioinformatics that identifies equivalent sites within molecular sequences.

    21%

  3. BLAST (biotechnology)

    Bioinformatics search algorithm.

    12%

  4. Hopper (microarchitecture)

    GPU microarchitecture designed by Nvidia.

    11%

  5. Approximate string matching

    Finding strings that approximately match a pattern.

    8.3%

  6. Levenshtein distance

    String metric for measuring edit distance.

    7.6%

  7. Michael Waterman

    American mathematician.

    1.9%

  8. Temple F. Smith

    American academic.

    1.9%