GPU-Euler: Sequence assembly using GPGPU

Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 -Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011

Volumn , Issue , 2011, Pages 153-160

  Mahmood, Syed Faraz ^a   Rangwala, Huzefa ^a  

^a George Mason University   (United States)

Author keywords

Euler tour; genome assembly; GPU

Indexed keywords

BACTERIAL GENOMES; COST EFFECTIVE; DATA PARALLEL; EMPIRICAL EVALUATIONS; EULER TOUR; GENERAL PURPOSE; GENERAL-PURPOSE COMPUTING; GENOME ASSEMBLY; GENOMICS; GPU; GRAPHIC PROCESSOR UNITS; HIGH THROUGHPUT; POSSIBLE SOLUTIONS; PROGRAMMING INTERFACE;

GENES;

PROGRAM PROCESSORS;

EID: 81555227859     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCC.2011.29     Document Type: Conference Paper

References (33)

1. W. R. Jeck, J. A. Reinhardt, D. A. Baltrus, M. T. Hickenbotham, V. Magrini, E. R. Mardis, J. L. Dangl, and C. D. Jones, "Extending assembly of short DNA sequences to handle error," Bioinformatics, vol. 23, no. 21, p. 2942, 2007.
2. P. A. Pevzner, H. Tang, and M. S. Waterman, "An eulerian path approach to DNA fragment assembly," Proceedings of the National Academy of Sciences of the United States of America, vol. 98, no. 17, p. 9748, 2001.
3. E. W. Myers, "The fragment assembly string graph," Bioinformatics, vol. 21, no. suppl-2, pp. ii79-ii85, 2005. [Online]. Available: http://www.bioinformatics.oxfordjournals.org/cgi/ doi/10.1093/bioinformatics/ bti1114
4. J. T. Simpson, K. Wong, S. D. Jackman, J. E. Schein, S. J. Jones, and I. Birol, "ABySS: a parallel assembler for short read sequence data," Genome Research, vol. 19, no. 6, pp. 1117-1123, 2009. [Online]. Available: http://genome.cshlp.org/cgi/doi/10.1101/gr.089532.108
5. B. Jackson, P. Schnable, and S. Aluru, "Parallel short sequence assembly of transcriptomes," BMC bioinformatics, vol. 10, no. Suppl 1, p. S14,2009.
6. B. G. Jackson and S. Aluru, "Parallel construction of bidirected string graphs for genome assembly," in 2008 37th International Conference on Parallel Processing, Portland, Oregon, USA, 2008, pp. 346-353. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4625868
7. P. A. Pevzner, H. Tang, and M. S. Waterman, "A new approach to fragment assembly in DNA sequencing," in Proceedings of the fifth annual international conference on Computational biology, 2001, pp. 256-267.
8. M. J. Chaisson and P. A. Pevzner, "Short read fragment assembly of bacterial genomes," Genome Research, vol. 18, no. 2, pp. 324-330, 2008. [Online]. Available: http://www.genome.org/cgi/doi/10.1101/gr.7088808
9. J. C. Venter, H. O. Smith, and L. Hood, "A new strategy for genome sequencing," Nature, vol. 381, no. 6581, pp. 364-366, May 1996. [Online]. Available: http://dx.doi.org/10.1038/381364a0
10. M. Pop, "Genome assembly reborn: recent computational challenges," Briefings in Bioinformatics, vol. 10, no. 4, pp. 354-366, 2009. [Online]. Available: http://bib.oxfordjournals.org/cgi/doi/10.1093/bib/ bbp026
11. P. Medvedev, K. Georgiou, G. Myers, and M. Brudno, "Computability of models for sequence assembly," Algorithms in Bioinformatics, pp. 289-301, 2007.
12. D. Hernandez, P. Francois, L. Farinelli, M. Osteras, and J. Schrenzel, "De novo bacterial genome sequencing: Millions of very short reads assembled on a desktop computer," Genome Research, vol. 18, no. 5, pp. 802-809, 2008. [Online]. Available: http://www.genome.org/cgi/ doi/10.1101/gr.072033.107
13. R. M. Idury and M. S. Waterman, "A new algorithm for dna sequence assembly," Journal of Computational Biology, vol. 2, pp. 291-306, 1995.
14. D. R. Zerbino and E. Birney, "Velvet: Algorithms for de novo short read assembly using de bruijn graphs," Genome Research, vol. 18, no. 5, pp. 821-829, 2008. [Online]. Available: http: //www.genome.org/cgi/doi/10.1101/gr. 074492.107
15. M. Hossain, N. Azimi, and S. Skiena, "Crystallizing short- read assemblies around seeds," BMC Bioinformatics, vol. 10, no. Suppl 1, p. S16, 2009. [Online]. Available: http://www.biomedcentral.com/ 1471-2105/10/S1/S16
16. J. Butler, I. MacCallum, M. Kleber, I. A. Shlyakhter, M. K. Belmonte, E. S. Lander, C. Nusbaum, and D. B. Jaffe, "ALLPATHS: de novo assembly of whole-genome shotgun microreads," Genome Research, vol. 18, no. 5, p. 810, 2008.
17. J. Greiner, "A comparison of parallel algorithms for connected components," in Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures - SPAA '94, Cape May, New Jersey, United States, 1994, pp. 16-25. [Online]. Available: http://portal.acm.org/citation.cfm?doid= 181014.181021
18. G. Cong and D. A. Bader, "Techniques for designing efficient parallel graph algorithms for SMPs and multicore processors," Lecture Notes in Computer Science, vol. 4742, p. 137, 2007.
19. F. Y. Chin, J. Lam, I. Chen et al., "Efficient parallel algorithms for some graph problems," Communications of the ACM, vol. 25, no. 9, p. 665,1982.
20. T. Hsu, V. Ramachandran, and N. Dean, Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. University of Texas at Austin, Dept. of Computer Sciences,1993.
21. S. Makki, "A distributed algorithm for constructing an Eulerian tour," in Performance, Computing, and Communications Conference, 1997. IPCCC 1997., IEEE International. IEEE, 1997, pp. 94-100.
22. B. Awerbuch, A. Israeli, and Y. Shiloach, "Finding euler circuits in logarithmic parallel time," in Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, Not Known, 1984, pp. 249-257. [Online]. Available: http://portal.acm.org/citation.cfm?doid= 800057.808688
23. Awerbuch and Shiloach, "New connectivity and MSF algorithms for Shuffle-Exchange network and PRAM," IEEE Transactions on Computers, vol. C-36, no. 10, pp. 1258-1263, 1987. [Online]. Available: http://ieeexplore.ieee. org/lpdocs/epic03/wrapper.htm?arnumber=1676869
24. J. Siek, L. Lee, A. Lumsdaine, L. Lee, L. Blackford, J. Demmel, J. Dongarra, I. Duff, S. Hammarling, M. Heroux et al., "The boost graph library: User guide and reference manual," in Proceedings of the, vol. 243, 2002, pp. 112-121.
25. Y. Shiloach and U. Vishkin, "An (log) parallel connectivity algorithm," Journal of Algorithms, vol. 3, no. 1, pp. 57-67, 1982. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/ 0196677482900086
26. D. A. Alcantara, A. Sharf, F. Abbasinejad, S. Sengupta, M. Mitzenmacher, J. D. Owens, and N. Amenta, "Realtime parallel hashing on the GPU," ACM Transactions on Graphics, vol. 28, no. 5, p. 1, 2009. [Online]. Available: http://portal.acm.org/citation.cfm?doid=1618452.1618500
27. M. Harris, S. Sengupta, and J. D. Owens, "Parallel prefix sum (scan) with cuda," in GPU Gems 3, H. Nguyen, Ed. Addison Wesley, Aug.2007.
28. S. Sengupta, M. Harris, and M. Garland, "Efficient parallel scan algorithms for GPUs," Citeseer, Tech. Rep., 2008.
29. S. Sengupta, M. Harris, Y. Zhang, and J. D. Owens, "Scan primitives for gpu computing," in Graphics Hardware 2007. ACM, Aug. 2007,pp. 97-106.
30. Nvidia, "Cuda toolkit reference manual."
31. D. C. Richter, F. Ott, A. F. Auch, R. Schmid, and D. H. Huson, "MetaSim- a sequencing simulator for genomics and metagenomics," PLoS One, vol. 3, no. 10, p. 3373, 2008.
32. S. Kurtz, A. Phillippy, A. Delcher, M. Smoot, M. Shumway, C. Antonescu, and S. Salzberg, "Versatile and open software for comparing large genomes," Genome biology, vol. 5, no. 2, p. R12, 2004.
33. B. G. Jackson, M. Regennitter, X. Yang, P. S. Schnable, and S. Aluru, "Parallel de novo assembly of large genomes from high-throughput short reads," in Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium on, 2010, pp. 1-10.