TY - GEN
T1 - Accelerating De Novo Assembler WTDBG2 on Commodity Servers
AU - Dun, Ming
AU - Li, Yunchun
AU - You, Xin
AU - Sun, Qingxiao
AU - Luan, Zerong
AU - Yang, Hailong
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - De novo genome assembly reconstructs the chromosomes from massive relatively short fragmented reads and serves as fundamental for studying new species where there is no reference genome. Wtdbg2 is a de novo assembler for long reads that is up to hundreds of kilobases. It is based on fuzzy-Bruijn graph (FBG) and is ten times faster than the cutting-edge assemblers such as Canu. However, the performance of wtdbg2 still requires further improvement: 1) it requires up to terabytes of memory to compute the assembly, which is infeasible to run on commodity server; 2) it requires tens of hours for assembling on large datasets such as genomes of homo sapiens. To address the above drawbacks, we propose several optimization techniques for accelerating wtdbg2 on commodity server, including a memory auto-tuning scheme, sequence alignment optimization and intermediate result elimination in the output procedure. We compare the optimized wtdbg2 with the original implementation and two cutting-edge assemblers on real-world datasets. The experiment results demonstrate that optimized wtdbg2 achieves maximum and average speedup of 2.31× and 1.54× respectively. In addition, our proposed optimization reduces the memory usage of wtdbg2 by 39.5% without affecting the correctness.
AB - De novo genome assembly reconstructs the chromosomes from massive relatively short fragmented reads and serves as fundamental for studying new species where there is no reference genome. Wtdbg2 is a de novo assembler for long reads that is up to hundreds of kilobases. It is based on fuzzy-Bruijn graph (FBG) and is ten times faster than the cutting-edge assemblers such as Canu. However, the performance of wtdbg2 still requires further improvement: 1) it requires up to terabytes of memory to compute the assembly, which is infeasible to run on commodity server; 2) it requires tens of hours for assembling on large datasets such as genomes of homo sapiens. To address the above drawbacks, we propose several optimization techniques for accelerating wtdbg2 on commodity server, including a memory auto-tuning scheme, sequence alignment optimization and intermediate result elimination in the output procedure. We compare the optimized wtdbg2 with the original implementation and two cutting-edge assemblers on real-world datasets. The experiment results demonstrate that optimized wtdbg2 achieves maximum and average speedup of 2.31× and 1.54× respectively. In addition, our proposed optimization reduces the memory usage of wtdbg2 by 39.5% without affecting the correctness.
KW - Auto-tuning
KW - Computational biology
KW - Genome assembly
KW - Load balance
KW - Performance optimization
KW - wtdbg2
UR - https://www.scopus.com/pages/publications/85092622398
U2 - 10.1007/978-3-030-60245-1_16
DO - 10.1007/978-3-030-60245-1_16
M3 - 会议稿件
AN - SCOPUS:85092622398
SN - 9783030602444
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 232
EP - 246
BT - Algorithms and Architectures for Parallel Processing - 20th International Conference, ICA3PP 2020, Proceedings
A2 - Qiu, Meikang
PB - Springer Science and Business Media Deutschland GmbH
T2 - 20th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2020
Y2 - 2 October 2020 through 4 October 2020
ER -