Abstract
With an aim to understand the information encoded by DNA sequences, databases containing large amount of DNA sequence information are frequently compared and searched for matching or near-matching patterns. This kind of similarity calculation is known as sequence alignment. To date, the most popular algorithms for this operation are heuristic approaches such as BLAST and FASTA which give high speed but low sensitivity, i.e. significant matches may be missed by the searches. Another algorithm, the Smith-Waterman algorithm, is a more computationally expensive algorithm but achieves higher sensitivity. In this paper, an improved systolic processing element cell for implementing the Smith-Waterman on a Xilinx Virtex FPGA is presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Miki, Y., et al.: A Strong Candidate for the Breast and Ovarian Cancer Susceptibility Gene, BRCA1. Science 266, 66–71 (1994)
European Bioinformatics Institute Home Page, FASTA searching program (2003), http://www.ebi.ac.uk/fasta33/
National Center for Biotechnology Information. NCBI BLAST home page (2003), http://www.ncbi.nlm.nih.gov/blast
Smith, T.F., Watermann, M.S.: Identification of common molecular subsequence. Journal of Molecular Biology 147, 196–197 (1981)
Sencel’s search software (2003), http://www.sencel.com
Steven, A.: Guccione and Eric Keller. Gene matching using JBits (2002), http://www.ccm.ece.vt.edu/hokiegene/papers/GeneMatching.pdf
Puttegowda, K., Worek, W., Pappas, N., Danapani, A., Athanas, P.: A runtime reconfigurable system for gene-sequence searching. In: Proceedings of the International VLSI Design Conference (January 2003) (to appear)
Leong, P., Leong, M., Cheung, O., Tung, T., Kwok, C., Wong, M., Lee, K.H.: Pilchard - a reconfigurable computing platform with memory slot interface. In: Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines (April 2001) (to appear)
Lipton, R.J., Lopresti, D.: A systolic array for rapid string comparison. In: Proceedings of the Chapel Hill Conference on VLSI, pp. 363–376 (1985)
Xilinx. The programmable logic data book (2003)
Hoang, D.T.: A systolic array for the sequence alignment problem. Brown University, Providence, RI, Technical Report, pages CS–92–22 (1992)
Hoang, D.T.: Searching genetic databases on splash 2. In: Proceedings 1993 IEEE Workshop on Field-Programmable Custom Computing Machines, pp. 185–192 (1993)
Lavenier, D.: SAMBA: Systolic Accelerators for Molecular Biological Applications (March 1996)
Paracel, inc. (2003), http://www.paracel.com
Celera genomics, inc. (2003), http://www.celera.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, C.W., Kwong, K.H., Lee, K.H., Leong, P.H.W. (2003). A Smith-Waterman Systolic Cell. In: Y. K. Cheung, P., Constantinides, G.A. (eds) Field Programmable Logic and Application. FPL 2003. Lecture Notes in Computer Science, vol 2778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45234-8_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-45234-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40822-2
Online ISBN: 978-3-540-45234-8
eBook Packages: Springer Book Archive