Biosequence Similarity Search on the Mercury System
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Biosequence similarity search is an important application in modern molecular biology. Search algorithms aim to identify sets of sequences whose extensional similarity suggests a common evolutionary origin or function. The most widely used similarity search tool for biosequences is BLAST, a program designed to compare query sequences to a database. Here, we present the design of BLASTN, the version of BLAST that searches DNA sequences, on the Mercury system, an architecture that supports high-volume, high-throughput data movement off a data store and into reconfigurable hardware. An important component of application deployment on the Mercury system is the functional decomposition of the application onto both the reconfigurable hardware and the traditional processor. Both the Mercury BLASTN application design and its performance analysis are described.
- Altschul, S.F., Madden, T.L., Schaffer, A.A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.J. (1997) Gapped BLAST and PSI-BLAST: A New Generation of Protein Database Search Programs. Nucleic Acids Res. 25: pp. 3389-3402 CrossRef
- Bloom, B. (1970) Space/Time Trade-Offs in Hash Coding with Allowable Errors. Commun ACM 13: pp. 422-426 CrossRef
- J. Buhler, “Mercury BLAST Dictionaries: Analysis and Performance Measurement,” Technical Report WUCSE-2007-13, Washington University in St. Louis, 2007.
- Buhler, J., Keich, U., Sun, Y. (2005) Designing Seeds for Similarity Search in Genomic DNA. J. Comput. Syst. Sci. 70: pp. 342-363 CrossRef
- Carter, L., Wegman, M. (1979) Universal Classes of Hashing Functions. J. Comput. Syst. Sci. 18: pp. 143-154 CrossRef
- R. Chamberlain and R. Cytron, “Novel Techniques for Processing Unstructured Data Sets,” in Proc. of IEEE Aerospace Conf., Montana, March 2005.
- R. Chamberlain and B. Shands, “Streaming Data from Disk Store to Application,” in Proc. of 3rd Int’l Workshop on Storage Network Architecture and Parallel I/Os, St. Louis, MO, September 2005, pp. 17–23.
- R. Chamberlain, B. Shands and J. White, “Achieving Real Data Throughput for an FPGA Co-Processor on Commodity Server Platforms,” in Proc. of 1st Workshop on Building Block Engine Architectures for Computers and Networks, Boston, MA, October 2004.
- R.D. Chamberlain, R.K. Cytron, M.A. Franklin and R.S. Indeck, The Mercury System: Exploiting Truly Fast Hardware for Data Search,” in Proc. of Int’l Workshop on Storage Network Architecture and Parallel I/Os, pp. 65–72, September 2003.
- Czech, Z.J., Havas, G., Majewski, B.S. (1997) Perfect Hashing. Theor. Comp. Sci. 182: pp. 1-143 CrossRef
- W.J. Dally et al., “Merrimac: Supercomputing with Streams.” in Proc. of Supercomputing Conf., November 2003.
- Dharmapurikar, S., Krishnamurthy, P., Sproull, T., Lockwood, J. (2004) Deep Packet Inspection Using Parallel Bloom Filters. IEEE Micro 24: pp. 52-61 CrossRef
- R.K. Singh et al., “BioSCAN: A Dynamically Reconfigurable Systolic Array for Biosequence Analysis,” in Proc. CERCS 96, 1996.
- M. Franklin, R. Chamberlain, M. Henrichs, B. Shands and J. White, “An Architecture for Fast Processing of Large Unstructured Data Sets,” in Proc. of the 22nd Int’l Conf. on Computer Design, October 2004, pp. 280–287.
- Hagerup, T., Miltersen, P.B., Pagh, R. (2001) Deterministic Dictionaries. J. Algorithms 41: pp. 69-85 CrossRef
- J.D. Hirschberg, R. Hughley and K. Karplus, “Kestrel: A Programmable Array for Sequence Analysis,” in Proc. of IEEE International Conference on Application-Specific Systems, Architecture, and Processors, 1996, pp. 23–34.
- D.T. Hoang, “Searching Genetic Databases on Splash 2,” in IEEE Workshop on FPGAs for Custom Computing Machines, 1993, pp. 185–191.
- Kent, W.J. (2002) BLAT: The BLAST-Like Alignment Tool. Genome Res. 12: pp. 656-664 CrossRef
- G. Knowles and P. Gardner-Stephen, “DASH: Localizing Dynamic Programming for Order of Magnitude Faster, Accurate Sequence Alignment,” in Proc. of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004, pp. 732–735.
- G. Knowles and P. Gardner-Stephen, “A New Hardware Architecture for Genomic and Proteomic Sequence Alignment,” in Proc. of IEEE Computational Systems Bioinformatics Conf., 2004.
- J. Lancaster, J. Buhler and R.D. Chamberlain, “Acceleration of Ungapped Extension in Mercury BLAST.” in Proc. of the 7th Workshop on Media and Streaming Processors, November 2005.
- D. Lavenier, S. Guytant, S. Derrien and S. Rubin, “A Reconfigurable Parallel Disk System for Filtering Genomic Banks,” in ERSA’03, Engineering of Reconfigurable Systems and Algorithms, 2003.
- Li, M., Ma, B., Kisman, D., Tromp, J. (2004) Patternhunter II: Highly Sensitive and Fast Homology Search. J. Bioinform. Comput. Biol. 2: pp. 417-439 CrossRef
- National Center for Biological Information, “Growth of GenBank,” 2002, http://www.ncbi.nlm.nih.gov/Genbank/genbankstats.html.
- Ning, Z., Cox, A.J., Mullikin, J.C. (2001) SSAHA: A Fast Search Method for Large DNA Databases. Genome Res. 11: pp. 1725-1729 CrossRef
- N. Pappas, “Searching Biological Sequence Databases Using Distributed Adaptive Computing,” Master’s thesis, Virginia Polytechnic Institute and State University, 2003.
- Pevzner, P.A., Waterman, M.S. (1995) Multiple Filtration and Approximate Pattern Matching. Algorithmica 13: pp. 135-154 CrossRef
- Ramakrishna, M.V., Fu, E., Bahcekapili, E. (1997) Efficient Hardware Hashing Functions for High Performance Computers. IEEE Trans. Comput. 46: pp. 1378-1381 CrossRef
- Reidel, E., Faloutsos, C., Gibson, G., Nagle, D. (2001) Active Disks for Large-Scale Data Processing. IEEE Comput. 34: pp. 68-74
- Smith, T.F., Waterman, M.S. (1981) Identification of Common Molecular Subsequences. J. Mol. Biol. 147: pp. 195-197 CrossRef
- Sprugnoli, R. (1977) Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets. Commun. ACM 20: pp. 841-850 CrossRef
- Tarjan, R.E., Yao, A.C.C. (1979) Storing a Sparse Table. Commun. ACM 22: pp. 606-611 CrossRef
- Waterston, R.H. (2002) Initial Sequencing and Comparative Analysis of the Mouse Genome. Nature 420: pp. 520-562 CrossRef
- B. West, R.D. Chamberlain, R.S. Indeck and Q. Zhang, “An FPGA-Based Search Engine for Unstructured Database,” in Proc. of 2nd Workshop on Application Specific Processors, December 2003, pp. 25–32.
- Y. Yamaguchi, T. Maruyama and A. Konagaya, “High Speed Homology Search with FPGAs,” in Pacific Symposium on Biocomputing, 2002, pp. 271–282.
- Q. Zhang, R.D. Chamberlain, R.S. Indeck, B. West and J. White, “Massively Parallel Data Mining Using Reconfigurable Hardware: Approximate String Matching,” in Proc. Workshop on Massively Parallel Processing, April 2004.
- Zhang, Z., Schwartz, S., Wagner, L., Miller, W. (2000) A Greedy Algorithm for Aligning DNA Sequences. J. Comput Biol. 7: pp. 203-214 CrossRef
- Biosequence Similarity Search on the Mercury System
The Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology
Volume 49, Issue 1 , pp 101-121
- Cover Date
- Print ISSN
- Online ISSN
- Springer US
- Additional Links
- DNA sequencing
- comparative annotation
- Industry Sectors