A Hybrid Parallel Strategy Based on String Graph Theory to Improve De Novo DNA Assembly on the TianHe-2 Supercomputer
暂无分享,去创建一个
[1] David W. Cheung,et al. SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler , 2012, GigaScience.
[2] R. Durbin,et al. Efficient de novo assembly of large genomes using compressed data structures. , 2012, Genome research.
[3] Kai Lu,et al. TH-1: China’s first petaflop supercomputer , 2010, Frontiers of Computer Science in China.
[4] Steven J. M. Jones,et al. Abyss: a Parallel Assembler for Short Read Sequence Data Material Supplemental Open Access , 2022 .
[5] E. Birney,et al. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. , 2008, Genome research.
[6] Juliane C. Dohm,et al. SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing. , 2007, Genome research.
[7] Vincent J. Magrini,et al. Extending assembly of short DNA sequences to handle error , 2007, Bioinform..
[8] Eugene W. Myers,et al. Computability of Models for Sequence Assembly , 2007, WABI.
[9] René L. Warren,et al. Assembling millions of short DNA sequences using SSAKE , 2006, Bioinform..
[10] Eugene W. Myers,et al. The fragment assembly string graph , 2005, ECCB/JBI.
[11] Ieee Xiang,et al. The TianHe-1A Supercomputer: Its Hardware and Software , 2011 .