A de novo Genome Assembler based on MapReduce and Bi-directed de Bruijn Graph

被引：0
|
作者：
Zhang, Yuehua [1 ]
Xuan, Pengfei [1 ]
Wang, Yunsheng [1 ]
Srimani, Pradip K. [1 ]
Luo, Feng [1 ]
机构：
[1] Clemson Univ, Sch Comp, Clemson, SC 29634 USA
来源：
2016 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM) | 2016年
关键词：
next generation sequencing (NGS); assembly; MapReduce; bi-directed de Bruijn graph; ALGORITHMS; PARALLEL;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The next generation sequencing (NGS) techniques have enabled biologists to generate large DNA sequences in a high-throughput and low-cost way. Assembly of NGS reads still face great challenges due to the short reads and enormous high volume. In this paper, we presented a new assembler, called GAMR, which is based on bi-directed de Bruijn graph and implemented using MapReduce framework. We designed distributed algorithm for each step in GAMR, making it scalable in assembling large-scale genomes. We evaluated GAMR using GAGE's data and compared it against other NGS assemblers. The results showed GAMR assembled contigs and scaffolds with better accuracy and longer N50 values.
引用
收藏
页码：65 / 71
页数：7
相关论文
共 50 条
  • [1] IDBA - A Practical Iterative de Bruijn Graph De Novo Assembler
    Peng, Yu
    Leung, Henry C. M.
    Yiu, S. M.
    Chin, Francis Y. L.
    [J]. RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, PROCEEDINGS, 2010, 6044 : 426 - 440
  • [2] T-IDBA: A de novo Iterative de Bruijn Graph Assembler for Transcriptome
    Peng, Yu
    Leung, Henry C. M.
    Yiu, S. M.
    Chin, Francis Y. L.
    [J]. RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, 2011, 6577 : 337 - 338
  • [3] AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS
    Kundeti, Vamsi
    Rajasekaran, Sanguthevar
    Dinh, Heiu
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2012, 4 (02)
  • [4] An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs
    Kundeti, Vamsi
    Rajasekaran, Sanguthevar
    Heiu Dinh
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT 1, 2010, 6508 : 184 - 196
  • [5] A New Approach for De Bruijn Graph Construction in De Novo Genome Assembling
    de Armas, Elvismary Molina
    Castro, Liester Cruz
    Holanda, Maristela
    Lifschitz, Sergio
    [J]. 2019 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2019, : 1842 - 1849
  • [6] Parallel De Bruijn Graph Construction and Traversal for De Novo Genome Assembly
    Georganas, Evangelos
    Buluc, Aydin
    Chapman, Jarrod
    Oliker, Leonid
    Rokhsar, Daniel
    Yelick, Katherine
    [J]. SC14: INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2014, : 437 - 448
  • [7] The directed genus of the de Bruijn graph
    Hales, Alfred W.
    Hartsfield, Nora
    [J]. DISCRETE MATHEMATICS, 2009, 309 (17) : 5259 - 5263
  • [8] Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
    Vamsi K Kundeti
    Sanguthevar Rajasekaran
    Hieu Dinh
    Matthew Vaughn
    Vishal Thapar
    [J]. BMC Bioinformatics, 11
  • [9] Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
    Kundeti, Vamsi K.
    Rajasekaran, Sanguthevar
    Dinh, Hieu
    Vaughn, Matthew
    Thapar, Vishal
    [J]. BMC BIOINFORMATICS, 2010, 11
  • [10] IDBA-tran: a more robust de novo de Bruijn graph assembler for transcriptomes with uneven expression levels
    Peng, Yu
    Leung, Henry C. M.
    Yiu, Siu-Ming
    Lv, Ming-Ju
    Zhu, Xin-Guang
    Chin, Francis Y. L.
    [J]. BIOINFORMATICS, 2013, 29 (13) : 326 - 334
12345