1981 IdentificationOfCommonMolecSubseqs

From GM-RKB
Jump to: navigation, search

Subject Headings: Smith-Waterman Sequence Alignment Algorithm, Sequence Alignment Algorithm.

Cited By

  • (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Smith-Waterman_algorithm
    • The Smith-Waterman algorithm is a well-known algorithm for performing local sequence alignment; that is, for determining similar regions between two nucleotide or protein sequences. Instead of looking at the total sequence, the Smith-Waterman algorithm compares segments of all possible lengths and optimizes the similarity measure.

1990

Notes

Quotes

References


,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
1981 IdentificationOfCommonMolecSubseqsTemple F. Smith
Michael S. Waterman
Identification of Common Molecular SubsequencesJournal of Molecular Biologyhttp://gel.ym.edu.tw/~chc/AB papers/03.pdf1981

[[doi::10.1016/0022-2836(81)90087-5].|]]