Loading...
Please wait, while we are loading the content...
Similar Documents
An Analysis of BLASTP Implementation on NVIDIA GPUs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Glasco, David |
| Copyright Year | 2012 |
| Abstract | 1.0 Introduction Given a new protein sequence, scanning existing protein databases for similar sequences is becoming an important and repeated task in bioinformics. Initially, the Smith-Waterman [1] algorithm was developed to find local, optimal matches between an input sequence and a given database of existing protein sequences. The Smith-Waterman algorithm uses a recursive algorithm (dynamic programming) to perform the search. Unfortunately, the algorithm is too compute intensive and has an execution time that is quadratic with respect to the length of protein sequences [2]. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://cmgm.stanford.edu/biochem218/Projects%202012/Glasco.pdf |
| Alternate Webpage(s) | http://biochem218.stanford.edu/Projects%202012/Glasco.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
