The Smith–Waterman algorithm cardSmith–Waterman algorithm

Smith–Waterman algorithm

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

The Smith–Waterman algorithm performs local sequence alignment; that is, for determining similar regions between two strings of nucleic acid sequences or protein sequences.

Excerpt from the Wikipedia article “Smith–Waterman algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Wikipedista JockBanan, CC0, via Wikimedia Commons.

Open free boosters and add Smith–Waterman algorithm to your collection.

Play for free

Related cards