Sequence analysis with the Kestrel SIMD parallel processor.
Computer aided sequence analysis is a critical aspect of current biological research. Sequence information from the genome sequencing projects fills databases so quickly that humans cannot examine it all. Hence there is a heavy reliance on computer algorithms to point out the few important nuggets for human examination. Sequence search algorithms range from simple to complex, as does the representation of the biological data. Typically though, simple algorithms are used on the simplest of data representations because of the large computational demands of anything more complex. This leads to missed hits because the simple search techniques are often not sufficiently sensitive. Here we describe the implementation of several sensitive sequence analysis algorithms on the Kestrel parallel processor, a single-instruction multiple-data (SIMD) processor developed and built at UCSC. Performance of the Smith-Waterman and Hidden Markov Model algorithms, with both Viterbi and Expectation Maximization methods ranges from 6 to 20 times faster than standard computers.
Grate
L
L
Department of Computer Engineering, University of California, Santa Cruz, CA 95064, USA. leslie@cse.ucsc.edu
Diekhans
M
M
Dahle
D
D
Hughey
R
R
D000465:Algorithms; D003201:Computers; D016208:Databases, Factual; D008390:Markov Chains; D017421:Sequence Analysis / Q000706:statistics & numerical data*