Skip to main content
. 2012 Sep 3;28(18):i333–i339. doi: 10.1093/bioinformatics/bts378

Fig. 3.

Fig. 3.

Graph-based paired-end clustering: a graph G of structural rearrangements with two connected components C1 and C2 and two maximal cliques (pi,pj,pk) and (pm,pn). The non-clique edges are in gray. For simplicity, edge weights have been omitted