PASQUAL: Parallel techniques for next generation genome sequence assembly

IEEE Transactions on Parallel and Distributed Systems

Volumn 24, Issue 5, 2013, Pages 977-986

  Liu, Xing ^a   Pande, Pushkar R ^a   Meyerhenke, Henning ^b   Bader, David A ^a  

^a Georgia Institute of Technology   (United States)

^b KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

de novo sequence assembly; high performance bioinformatics; Parallel algorithms; parallel suffix array construction; shared memory parallelism

Indexed keywords

COMPRESSED DATA STRUCTURES; COMPUTATIONAL CHALLENGES; MULTICORE ARCHITECTURES; NEXT-GENERATION SEQUENCING; SEQUENCE ASSEMBLIES; SHARED MEMORY PARALLELISM; SUFFIX ARRAYS; SYNTHETIC AND REAL DATA;

BIOINFORMATICS; DATA STRUCTURES; GENES; PARALLEL ALGORITHMS; SOFTWARE ARCHITECTURE;

PARALLEL ARCHITECTURES;

EID: 84875722901     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2012.190     Document Type: Article

References (30)

1. B.H. Bloom, "Space/Time Trade-Offs in Hash Coding with Allowable Errors," Comm. ACM, vol. 13, pp. 422-426, 1970.
2. D. Bryant, W. Wong, and T. Mockler, "QSRA-A Quality-Value Guided de Novo Short Read Assembler," BMC Bioinformatics, vol. 10, no. 1, p. 69, 2009.
3. M. Burrows and D.J. Wheeler, "A Block-Sorting Lossless Data Compression Algorithm," technical report, Digital SRC Research Report, 1994.
4. 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, pp. 810-820, 2008. (Pubitemid 351645071)
5. Convey Computer Corporation, "Convey Graph Constructor Guide," Dec. 2011.
6. H. Dinh and S. Rajasekaran, "A Memory-Efficient Data Structure Representing Exact-Match Overlap Graphs with Application for Next-Generation DNA Assembly," Bioinformatics, vol. 27, pp. 1901-1907, 2011.
7. J. Dohm, C. Lottaz, T. Borodina, and H. Himmelbauer, "SHARCGS, A Fast and Highly Accurate Short-Read Assembly Algorithm for de Novo Genomic Sequencing," Genome Research, vol. 17, no. 11, pp. 1697-1706, 2007. (Pubitemid 350074864)
8. P. Ferragina and G. Manzini, "Opportunistic Data Structures with Applications," Proc. 41st Ann. Symp. Foundations of Computer Science, pp. 390-398, 2000. (Pubitemid 32075908)
9. D. Hernandez, P. François, 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, p. 802, 2008.
10. 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," Proc. IEEE Int'l Parallel and Distributed Processing Symp., 2010.
11. J. Kececioglu and E. Myers, "Combinatorial Algorithms for DNA Sequence Assembly," Algorithmica, vol. 13, no. 1, pp. 7-51, 1995.
12. N.J. Larsson and K. Sadakane, "Faster Suffix Sorting," Theoretical Computer Science, vol. 387, pp. 258-272, Nov. 2007. (Pubitemid 47633443)
13. R. Li, H. Zhu, J. Ruan, W. Qian, X. Fang, Z. Shi, Y. Li, S. Li, G. Shan, K. Kristiansen, S. Li, H. Yang, J. Wang, and J. Wang, "De Novo Assembly of Human Genomes with Massively Parallel Short Read Sequencing," Genome Research, vol. 20, no. 2, pp. 265-272, Feb. 2010.
14. U. Manber and G. Myers, "Suffix Arrays: A New Method for On-Line String Searches," Proc. First Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 319-327, 1990.
15. M.A. Maniscalco and S.J. Puglisi, "An Efficient, Versatile Approach to Suffix Sorting," J. Experimental Algorithmics, vol. 12, pp. 1-23, June 2008.
16. E. Mardis, "The Impact of Next-Generation Sequencing Technology on Genetics," Trends in Genetics, vol. 24, no. 3, pp. 133-141, 2008.
17. A. Mellmann et al., "Prospective Genomic Characterization of the German Enterohemorrhagic Escherichia Coli o104:h4 Outbreak by Rapid Next Generation Sequencing Technology," PLoS ONE, vol. 6, no. 7, 2011.
18. J.R. Miller, S. Koren, and G. Sutton, "Assembly Algorithms for Next-Generation Sequencing Data," Genomics, vol. 95, no. 6, pp. 315-327, 2010.
19. E.W. Myers, "The Fragment Assembly String Graph," Bioinformatics, vol. 21, no. suppl 2, 2005.
20. N. Nagarajan and M. Pop, "Sequencing and Genome Assembly using Next-Generation Technologies," Proc. Computational Biology, vol. 673, pp. 1-17, 2010.
21. K. Paszkiewicz and D.J. Studholme, "De Novo Assembly of Short Sequence Reads," Briefings in Bioinformatics, vol. 11, no. 5, pp. 457-472, 2010.
22. M. Pop, "Genome Assembly Reborn: Recent Computational Challenges," Briefings in Bioinformatics, vol. 10, no. 4, pp. 354-366, 2009.
23. S.J. Puglisi, W.F. Smyth, and A.H. Turpin, "A Taxonomy of Suffix Array Construction Algorithms," ACM Computing Surveys, vol. 39, July 2007.
24. E.E. Schadt, S. Turner, and A. Kasarskis, "A Window into Third-Generation Sequencing," Human Molecular Genetics, vol. 19, no. R2, pp. R227-R240, 2010.
25. 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, pp. 1117-1123, June 2009.
26. J. Simpson and R. Durbin, "Efficient Construction of an Assembly String Graph using the FM-Index," Bioinformatics, vol. 26, no. 12, pp. i367-i373, 2010.
27. R. Warren, G. Sutton, S. Jones, and R. Holt, "Assembling Millions of Short DNA Sequences Using SSAKE," Bioinformatics, vol. 23, no. 4, pp. 500-501, 2007. (Pubitemid 46323134)
28. D. 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. (Pubitemid 351645072)
29. S. Zhang and G. Nong, "Fast and Space Efficient Linear Suffix Array Construction," Proc. Data Compression Conf., p. 553, 2008.
30. W. Zhang, J. Chen, Y. Yang, Y. Tang, J. Shang, and B. Shen, "A Practical Comparison of de Novo Genome Assembly Software Tools for Next-Generation Sequencing Technologies," PLoS ONE, vol. 6, no. 3, p. e17915, 2011.