论文部分内容阅读
A challenge of assembling long noisy reads from third generation sequencing (TGS) is reducing its requirement of computing resource.We present a new assembly graph termed fuzzy Bruijn graph for efficiently assembling big genomes using TGS data.The key difference between fuzzy Bruijn graph and De Bruijn graph is that the overlap length can be kilo bases in the former for long noisy reads.In experiment,it assembled human genome in 675.4 CPU.Hours and resulted in N50 contig of 22.2 Mega bases.