Smith–Waterman algorithm
algorithm performs local sequence alignment
Press Enter · cited answer in seconds
0 sources
Smith–Waterman algorithm
Summary
Smith–Waterman algorithm is a search algorithm[1]. It has Wikipedia articles in 13 language editions, a strong signal of global cultural recognition.[2]
Key Facts
- Smith–Waterman algorithm's instance of is recorded as search algorithm[3].
- Temple F. Smith is named after Smith–Waterman algorithm[4].
- Michael Waterman is named after Smith–Waterman algorithm[5].
- Smith–Waterman algorithm's Commons category is recorded as Smith–Waterman algorithm[6].
- 1981 marks the founding of Smith–Waterman algorithm[7].
- Smith–Waterman algorithm's computes solution to is recorded as local alignment[8].
Body
Designation and Status
Smith–Waterman algorithm's instance of is recorded as search algorithm[3].
History and Context
1981 marks the founding of Smith–Waterman algorithm[7]. Things named after include Temple F. Smith[4], a bioinformatician[9], b. 1939[10], of United States[11], awarded the ISCB Senior Scientist Award[12] and Michael Waterman[5], a mathematician[13], b. 1942[14], of United States[15], awarded the Guggenheim Fellowship[16].
Why It Matters
Smith–Waterman algorithm has Wikipedia articles in 13 language editions, a strong signal of global cultural recognition.[2]