Advanced SearchSearch Tips
Optimized and Portable FPGA-Based Systolic Cell Architecture for Smith-Waterman-Based DNA Sequence Alignment
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Optimized and Portable FPGA-Based Systolic Cell Architecture for Smith-Waterman-Based DNA Sequence Alignment
Shah, Hurmat Ali; Hasan, Laiq; Koo, Insoo;
  PDF(new window)
The alignment of DNA sequences is one of the important processes in the field of bioinformatics. The Smith-Waterman algorithm (SWA) performs optimally for aligning sequences but is computationally expensive. Field programmable gate array (FPGA) performs the best on parameters such as cost, speed-up, and ease of re-configurability to implement SWA. The performance of FPGA-based SWA is dependent on efficient cell-basic implementation-unit design. In this paper, we present an optimized systolic cell design while avoiding oversimplification, very large-scale integration (VLSI)-level design, and direct mapping of iterative equations such as previous cell designs. The proposed design makes efficient use of hardware resources and provides portability as the proposed design is not based on gate-level details. Our cell design implementing a linear gap penalty resulted in a performance improvement of 32× over a GPP platform and surpassed the hardware utilization of another implementation by a factor of 4.23.
Bioinformatics;DNA sequence alignment;FPGA architecture;Smith-Waterman algorithm;Systolic cell;
 Cited by
B. Langmead, C. Trapnell, M. Pop, and S. L. Salzberg, "Ultrafast and memory-efficient alignment of short DNA sequences to the human genome," Genome Biology, vol. 10, no. 3, article no. R25, 2006.

L. Hasan, Z. Al-Ars, and S. Vassiliadis, "Hardware acceleration of sequence alignment algorithms: an overview," in Proceedings of IEEE International Conference on Design and Technology of Integrated Systems in Nanoscale Era (DTIS), Rabat, Moroco, pp. 92-97, 2007.

T. F. Smith and M. S. Waterman, “Identification of common molecular subsequences,” Journal of Molecular Biology, vol. 147, no. 1, pp. 195-197, 1981. crossref(new window)

K. Benkrid, A. Akoglu, C. Ling, Y. Song, Y. Liu, and X. Tian, "High performance biological pairwise sequence alignment: FPGA versus GPU versus cell BE versus GPP," International Journal of Reconfigurable Computing, vol. 2012, article no. 7, 2012.

R. Wain, I. Bush, M. Guest, M. Deegan, I. Kozin, and C. Kitchen, An Overview of FPGAs and FPGA Programming: Initial Experiences at Daresbury. Cheshire: Council for the Central Laboratory of the Research Councils, 2006.

M. Gok and C. Yilmaz, "Efficient cell designs for systolic smith-waterman implementations," in Proceedings of IEEE International Conference on Field Programmable Logic and Applications (FPL'06), Madrid, Spain, pp. 1-4, 2006.

H. A. Shah, L. Hasan, and N. Ahmad, "An optimized and low-cost FPGA-based DNA sequence alignment: a step towards personal genomics," in Proceedings of 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC), Osaka, Japan, pp. 2696-2699, 2013.

T. Moorthy, J. M. Correa, and S. Gopalakrishnan, "Gigabyte-scale alignment of biological sequences: a case study of IO bandwidth reconfiguration for FPGA acceleration," in Proceedings of 26th Annual IEEE Canadian Conference on Electrical and Computer Engineering (CCECE), Regina, SK, pp. 1-4, 2013.

R. Wilton, T. Budavari, B. Langmead, S. J. Wheelan, S. Salzberg, and A. Szalay, "Faster sequence alignment through GPU-accelerated restriction of the seed-and-extend search space," BioRxiv, 2014 [Internet], Available: crossref(new window)

Y. Liu and B. Schmidt, “GSWABE: faster GPU‐accelerated sequence alignment with optimal alignment retrieval for short DNA sequences,” Concurrency and Computation: Practice and Experience, vol. 27, no. 4, pp. 958-972, 2015. crossref(new window)

N. Neves, N. Sebastiao, A. Patricio, D. Matos, P. Tomas, P. Flores, and N. Roma, "BioBlaze: multi-core SIMD ASIP for DNA sequence alignment," in Proceedings of 24th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), Washington, DC, pp. 241-244, 2013.

S. B. Needleman and C. D. Wunsch, “A general method applicable to the search for similarities in the amino acid sequence of two proteins,” Journal of Molecular Biology, vol. 48, no. 3, pp. 443-453, 1970. crossref(new window)

L. Hasan, "Hardware acceleration of biological sequence alignment application," Ph.D. dissertation, Delft University of Technology, The Netherlands, 2011

C. W. Yu, K. H. Kwong, K. H. Lee, and P. H. Leong, “A Smith-Waterman systolic cell,” in New Algorithms, Architectures and Applications for Reconfigurable Computing. New York, NY: Springer, pp. 291-300, 2005.

H. T. Kung and C. E. Leiserson, “Algorithms for VLSI processor arrays,” in Introduction to VLSI Systems. Reading, MA: Addison-Wesley, pp. 271-292, 1980.

R. J. Lipton and D. Lopresti, "A systolic array for rapid string comparison," in Proceedings of the Chapel Hill Conference on VLSI, Chapel Hill, NC, pp. 363-376, 1985.

T. Oliver, B. Schmidt, and D. Maskell, "Hyper customized processors for bio-sequence database scanning on FPGAs," in Proceedings of the 2005 ACM/SIGDA 13th International Symposium on Field-Programmable Gate Arrays, Monterey, CA, pp. 229-237, 2005.

P. Zhang, G. Tan, and G. R. Gao, "Implementation of the Smith-Waterman algorithm on a reconfigurable supercomputing platform," in Proceedings of the 1st International Workshop on High-Performance Reconfigurable Computing Technology and Applications, Reno, NV, pp. 39-48, 2007.