Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A parallel implementation of the Smith-Waterman algorithm for massive sequences searching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Hsien-Yu Liao ; Dept. of Electr. & Comput. Eng., California State Polytech. Univ., Pomona, CA, USA ; Meng-Lai Yin ; Cheng, Y.

Efficient biological sequence searching is an important and challenging task in bioinformatics. Among those fundamental sequence analysis algorithms, the Smith-Waterman algorithm that adopts the dynamic programming mechanism provides very high sensitivity. Unfortunately, the inefficiency in performance of this algorithm limits its applications in the real world. With the advances in the engineering technology, massive parallelism can be achieved using the FPGA-based techniques. A parallel implementation methodology of the Smith-Waterman algorithm is presented. This method provides magnificent speedup over the traditional sequential implementation, while maintain the same level of sensitivity.

Published in:

Engineering in Medicine and Biology Society, 2004. IEMBS '04. 26th Annual International Conference of the IEEE  (Volume:2 )

Date of Conference:

1-5 Sept. 2004