Skip to main content
Fig. 9 | Algorithms for Molecular Biology

Fig. 9

From: On a greedy approach for genome scaffolding

Fig. 9

Left: The connected cluster graph \(G^*\) used for the pratical example. The graph contains the following cliques: \(c_1 =\{a,b,c,d\}\), \(c_2 = \{f,e\}\), \(c_3=\{h,g\}\), \(c_4=\{i,j,k,l\}\), \(c_5=\{m,n,o,p,q,r,s,t\}\) and \(c_6=\{u,v,w,x\}\). Right: Tree structure of \(G^*\) used in the algorithm. The root of these structure is the clique \(c_6\)

Back to article page