QQ客服 官方微博 反馈留言

	DGraph: Algorithms for shortgun reads assembly using De Bruijn Graph
	Meng jintao; Yuan jianrui; Cheng jiefeng; Wei yanjie; Feng shengzhong
	2012
会议名称	9th IFIP International Conference, NPC 2012
会议地点	Gwangju, Korea
英文摘要	Massively parallel DNA sequencing platforms have become widely available, reducing the cost of DNA sequencing by over two orders of magnitude, and democratizing the field by putting the sequencing capacity of a major genome center in the hands of individual investigators. New challenges include the development of robust protocols for generating sequencing libraries, building effective new approaches to resequence and data-analysis. In this paper we demonstrate a new sequencing algorithm, named DGraph, which has two modules, one module is responsible to construct De Bruijn graph by cutting reads into k-mers, and the other's duty is to simplify this graph and collect all long contigs. The authors didn't adapt the sequence graph reductions operations proposed by RAMANA M.IDURY or Finding Eulerian Superpaths proved by Pavel A.Pevzner or bubble remove steps suggested by Danial Zerbino, As the first operations was computing expensive, and the second one was impractical, and the last one did not benefit either the quality of contigs or the efficiency of the assembler. Our assembler was focused only on efficient and effective error removal and path reduction operations. Applying DGraph to the simulation data of fruit fly Drosophila melanogaster chromosome X, DGraph(3min) is about six times faster than velvet 0.3 (19 mins), and its coverage (92.5%) is also better than velvet (78.2%) when k = 21. Compare to velvet, the results shows that the algorithm of DGraph is a faster program with high quality results. © IFIP International Federation for Information Processing 2012.(11 refs)
收录类别	EI
语种	英语
内容类型	会议论文
源URL	[http://ir.siat.ac.cn:8080/handle/172644/4222]
专题	深圳先进技术研究院_数字所
作者单位	2012
推荐引用方式 GB/T 7714	Meng jintao,Yuan jianrui,Cheng jiefeng,et al. DGraph: Algorithms for shortgun reads assembly using De Bruijn Graph[C]. 见:9th IFIP International Conference, NPC 2012. Gwangju, Korea.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。