UPDF AI

Identification of common molecular subsequences.

Temple F. Smith,M. Waterman

1981 · DOI: 10.1016/0022-2836(81)90087-5
Journal of Molecular Biology · 10,938 Citations

TLDR

This letter extends the heuristic homology algorithm of Needleman & Wunsch (1970) to find a pair of segments, one from each of two long sequences, such that there is no other Pair of segments with greater similarity (homology).