1981 IdentificationOfCommonMolecSubseqs
Jump to navigation
Jump to search
- (Smith & Waterman, 1981) ⇒ Temple F. Smith, Michael S. Waterman. (1981). “Identification of Common Molecular Subsequences.” In: Journal of Molecular Biology, 147. doi:10.1016/0022-2836(81)90087-5.
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
- (Altschul et al., 1990) ⇒ Stephen F. Altschul, Warren Gish, Webb Miller, Eugene W. Myers, and David J. Lipman. (1990). “Basic Local Alignment Search Tool.” In: Journal Molecular Biology, 215.
Notes
Quotes
References
,
Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
---|---|---|---|---|---|---|---|---|---|---|
1981 IdentificationOfCommonMolecSubseqs | Temple F. Smith Michael S. Waterman | Identification of Common Molecular Subsequences | http://gel.ym.edu.tw/~chc/AB papers/03.pdf |
[[doi::10.1016/0022-2836(81)90087-5].|]]