Fig. 3From: Representing and decomposing genomic structural variants as balanced integer flows on sequence graphsComputing the upper bound on a sequence graph. Note the existence of a perfect component connecting segment C to the rest of the sequence graph, containing nodes n 3, n 4, n 5 and n 6. In total, we obtain S=3, I=0, l=1, hence an upper bound of 2Back to article page