Fig. 4From: Recovering rearranged cancer chromosomes from karyotype graphsEulerian decompositions and contigs covering inference for Interval Adjacency Graphs. a Two distinct contig coverings corresponding to minimal Eulerian decompositions of the same IAG. b Transformation of IAG G with vertices with copy number excess (i.e., telomere vertices) into a an IAG G′ with no telomere vertices. Added supplemental segment and adjacency edges are shown in greyBack to article page