标题:A Dynamic Hashing Approach to Build the de Bruijn Graph for Genome Assembly
作者:Zhao, Kun; Liu, Weiguo; Voss, Gerrit; Mueller-Wittig, Wolfgang
通讯作者:Liu, W.
作者机构:[Zhao, Kun; Liu, Weiguo] Shandong Univ, Sch Comp Sci & Technol, Jinan, Shandong, Peoples R China.; [Voss, Gerrit; Mueller-Wittig, Wolfgang] Nanyang 更多
会议名称:IEEE International Conference of Region 10 (TENCON)
会议日期:OCT 22-25, 2013
来源:2013 IEEE INTERNATIONAL CONFERENCE OF IEEE REGION 10 (TENCON)
出版年:2013
DOI:10.1109/TENCON.2013.6719008
关键词:Dynamic hashing; De Bruijn graph; Genome assembly
摘要:The development of next-generation sequencing technologies has revolutionized the genome research and given rise to the explosive increase of DNA sequencing throughput. However, due to the continuing explosive growth of short-read database, these technologies face the challenges of short overlap and high throughput. The de Bruijn graph is particularly suitable for short-read assemblies, and its advantage is that the graph size will not be affected by the high redundancy of deep read coverage. With this character, the fragment assembly is cast as finding a path visiting every edge in the graph exactly once. In this paper, we present a new method to accelerate the genome assembly procedure. We have used a distributed dynamic hashing approach to construct the de Bruijn graph from short-read data. Evaluations using three paired-end datasets show that, our method outperforms previous parallel and distributed assemblers on a CPU cluster system.
收录类别:CPCI-S;EI;SCOPUS
Scopus被引频次:2
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894316847&doi=10.1109%2fTENCON.2013.6719008&partnerID=40&md5=a75ec50afcd837b910c071e3e549b187
TOP