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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

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