High speed biological sequence analysis with hidden Markov models on reconfigurable platforms.
Molecular biologists use hidden Markov models (HMMs) as a popular tool to statistically describe biological sequence families. This statistical description can then be used for sensitive and selective database scanning, e.g., new protein sequences are compared with a set of HMMs to detect functional similarities. Efficient dynamic-programming algorithms exist for solving this problem; however, current solutions still require significant scan times. These scan time requirements are likely to become even more severe due to the rapid growth in the size of these databases. This paper shows how reconfigurable architectures can be used to derive an efficient fine-grained parallelization of the dynamic programming calculation. We describe how this technique leads to significant runtime savings for HMM database scanning on a standard off-the-shelf field-programmable gate array (FPGA).
Oliver
Timothy F
TF
School of Computer Engineering, Nanyang Technological University, Singapore 639798, Singapore. tim.oliver@pmail.ntu.edu.sg
Schmidt
Bertil
B
Jakop
Yanto
Y
Maskell
Douglas L
DL
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D008390:Markov Chains; D010363:Pattern Recognition, Automated / Q000379:methods*; D016415:Sequence Alignment / Q000379:methods; D020539:Sequence Analysis, Protein / Q000379:methods*