Biosequence similarity search on the mercury system
Authors:
- K. GyangKGK. Gyang
- 8 November 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 365-375
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- An architecture for fast processing of large unstructured data sets2004
- Deep packet inspection using parallel bloom filtersIEEE Micro, 2004
- TheMercurysystem2003
- Kestrel: a programmable array for sequence analysis2002
- Initial sequencing and comparative analysis of the mouse genomeNature, 2002
- Active disks for large-scale data processingComputer, 2001
- Gapped BLAST and PSI-BLAST: a new generation of protein database search programsNucleic Acids Research, 1997
- Multiple filtration and approximate pattern matchingAlgorithmica, 1995
- Identification of common molecular subsequencesJournal of Molecular Biology, 1981
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970