SciCombinator

Discover the most talked about and latest scientific content & concepts.

W Shi, P Ji and F Zhao
Abstract
Currently, most paired link based scaffolding algorithms intrinsically mask the sequences between two linked contigs and bypass their direct link information embedded in the original de Bruijn assembly graph. Such disadvantage substantially complicates the scaffolding process and leads to the inability of resolving repetitive contig assembly. Here we present a novel algorithm, inGAP-sf, for effectively generating high-quality and continuous scaffolds. inGAP-sf achieves this by using a new strategy based on the combination of direct link and paired link graphs, in which direct link is used to increase graph connectivity and to decrease graph complexity and paired link is employed to supervise the traversing process on the direct link graph. Such advantage greatly facilitates the assembly of short-repeat enriched regions. Moreover, a new comprehensive decision model is developed to eliminate the noise routes accompanying with the introduced direct link. Through extensive evaluations on both simulated and real datasets, we demonstrated that inGAP-sf outperforms most of the genome scaffolding algorithms by generating more accurate and continuous assembly, especially for short repetitive regions.
Tweets*
47
Facebook likes*
2
Reddit*
0
News coverage*
134
Blogs*
5
SC clicks
0
Concepts
Graph, Discrete mathematics, Vertex-transitive graph, Planar graph, Algorithm, Graph theory
MeSH headings
-
comments powered by Disqus

* Data courtesy of Altmetric.com