论文信息 - DNA Assembly with De Bruijn Graphs Using an FPGA Platform

DNA Assembly with De Bruijn Graphs Using an FPGA Platform

This paper presents an FPGA implementation of a DNA assembly algorithm, called Ray, initially developed to run on parallel CPUs. The OpenCL language is used and the focus is placed on modifying and optimizing the original algorithm to better suit the new parallelization tool and the radically different hardware architecture. The results show that the execution time is roughly one fourth that of the CPU and factoring energy consumption yields a tenfold savings.

[1] de Ng Dick Bruijn. A combinatorial problem , 1946 .

[2] Dominique Lavenier,et al. FAssem: FPGA Based Acceleration of De Novo Genome Assembly , 2013, 2013 IEEE 21st Annual International Symposium on Field-Programmable Custom Computing Machines.

[3] TJHSST Senior,et al. Greedy Algorithm , 2013 .

[4] Implementing FPGA Design with the OpenCL Standard , 2010 .

[5] Mark J. P. Chaisson,et al. Short read fragment assembly of bacterial genomes. , 2008, Genome research.

[6] E. Birney,et al. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. , 2008, Genome research.

[7] François Laviolette,et al. Ray: Simultaneous Assembly of Reads from a Mix of High-Throughput Sequencing Technologies , 2010, J. Comput. Biol..

[8] M. Baker. De novo genome assembly: what every biologist should know , 2012, Nature Methods.

[9] Gaston H. Gonnet,et al. Expected Length of the Longest Probe Sequence in Hash Code Searching , 1981, JACM.