NIST

Smith-Waterman algorithm

(algorithm)

Definition: A means of searching protein databases to find those with the best alignment.

Aggregate child (... is a part of or used in me.)
dynamic programming.

Author: PEB

Implementation

Ahmed Moustafa's implementation in JAligner (Java).

More information

Temple F. Smith and Michael S. Waterman, Identification of Common Molecular Subsequences, J. Mol. Biol., 147:195-197, 1981.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 14 December 2020.
HTML page formatted Mon Dec 14 11:38:56 2020.

Cite this as:
Paul E. Black, "Smith-Waterman algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 14 December 2020. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/smithWaterman.html