Exploration of short reads genome mapping in hardware

Proceedings - 2010 International Conference on Field Programmable Logic and Applications, FPL 2010

Volumn , Issue , 2010, Pages 360-363

  Fernandez, Edward ^a   Najjar, Walid ^a   Harris, Elena ^a   Lonardi, Stefano ^a  

^a University of California Riverside   (United States)

Author keywords

Bioinformatics; Reconfigurable computing; String matching

Indexed keywords

APPROXIMATE STRING MATCHING; FPGA IMPLEMENTATIONS; GENOME ALIGNMENT; GENOME MAPPING; RECONFIGURABLE COMPUTING; SEQUENCING ERRORS; SOFTWARE TOOL; SPEED-UPS; STRING MATCHING;

BIOINFORMATICS; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SOFTWARE; DATA STRUCTURES; GENE ENCODING;

FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

EID: 79951751187     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FPL.2010.78     Document Type: Conference Paper

References (15)

1. Illumina Inc. http://www.illumina.com
2. O. Cret, Z. Mathe, P. Ciobanu, S. Marginean, and A. Darabant. A Hardware Algorithm for the Exact Subsequence Matching Problem in DNA Strings. Romanian Journal of Information Science and Technology, 2009.
3. H. Li, J. Ruan, and R. Durbin. Mapping Short DNA Sequencing Reads and Calling Variants Using Mapping Quality Scores. Genome Research, Vol. 18, No. 11, pp1851-1858, 2008.
4. S. Mikami, Y. Kawanaka, S. Wakabayashi, and S. Nagayama. Efficient FPGA-based Hardware Algorithms for Approximate String Matching. In the Proceedings of International Technical Conference on Circuits/Systems, Computers and Communications, 2008.
5. A.N.M.E. Rafiq, F. Gebali, and M.W. El-Kharashi. A Systolic Array Structure for String Searching. In the Proceedings of the International Conference on Electrical, Electronic and Computer Engineering, 2004.
6. A.D. Smith, Z. Xuan, and M.Q. Zhang. Using quality scores and longer reads improves accuracy of Solexa Read Mapping. BMC Bioinformatics, February, Vol. 9, No. 128, pp1471-2105, 2008.
7. Applied Biosystems. http://www3.appliedbiosystems.com/AB-Home/ applicationstechnologies/SOLiDSystemSequencing/index.htm
8. th International Conference on Field Programmable Logic and Applications (FPL), 2008.
9. A. Jacob, J. Lancaster, J. Buhler, and R. Chamberlain. FPGA accelerated seed generation in Mercury BLASTP. International Symposium on Field Programmable Custom Computing Machines (FCCM), 2007.
10. E. Sotoriades and A. Dollas. Design Space Exploration for the BLAST Algorithm Implementation. International Symposium on Field Programmable Custom Computing Machines (FCCM), 2007.
11. G. Caffarena, S. Bojanic, J. Lopez, C. Pedreira, and O. Nieto-Taladriz. High-Speed Systolic Array for Gene Matching. International Symposium on Field Programmable Gate Arrays (FPGA), 2004.
12. M. Gok and C. Yilmaz, Efficient Cell Designs for Systolic Smith-Waterman Implementations. International Conference on Field Programmable Logic and Applications (FPL), 2006.
13. P. Zhang, G. Tan, and G. Gao. Implementation of the Smith-Waterman algorithm on a Reconfigurable Supercomputing Platform. Conference on High Performance Networking and Computing, 2007.
14. BLAST. http://blast.ncbi.nlm.nih.gov/Blast.cgi
15. R.A. Wagner and M.J. Fisher. The string-to-string correction problem. Journal of ACM, vol 21, pp. 168-173. 1974.