Abstract
In order 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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Y. Miki, 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.
T. F. Smith and M. S. Watermann. 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.
K. Puttegowda, W. Worek, N. Pappas, A. Danapani and P. Athanas. A run-time reconfigurable system for gene-sequence searching. In Proceedings of the International VLSI Design Conference, page (to appear), Jan 2003.
P. Leong, M. Leong, O. Cheung, T. Tung, C. Kwok, M. Wong and K. H. Lee. Pilchard—a reconfigurable computing platform with memory slot interface. In Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines, page (to appear), April 2001.
Richard J. Lipton and Daniel Lopresti. A systolic array for rapid string comparison. In Proceedings of the Chapel Hill Conference on VLSI, pages 363–376, 1985.
Xilinx. The programmable logic data book, 2003.
D. T. Hoang. A systolic array for the sequence alignment problem. Brown University, Providence, RI, Technical Report, pages CS-92–22, 1992.
D. T. Hoang. Searching genetic databases on splash 2. In Proceedings 1993 IEEE Workshop on Field-Programmable Custom Computing Machines, pages 185–192, 1993.
Dominique Lavenier. 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
© 2005 Springer
About this chapter
Cite this chapter
Yu, C., Kwong, K., Lee, K., Leong, P. (2005). A Smith-Waterman Systolic Cell. In: Lysaght, P., Rosenstiel, W. (eds) New Algorithms, Architectures and Applications for Reconfigurable Computing. Springer, Boston, MA. https://doi.org/10.1007/1-4020-3128-9_23
Download citation
DOI: https://doi.org/10.1007/1-4020-3128-9_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-3127-4
Online ISBN: 978-1-4020-3128-1
eBook Packages: EngineeringEngineering (R0)