Skip to main content
. 2016 Sep 29;17:400. doi: 10.1186/s12859-016-1258-4

Fig. 3.

Fig. 3

Computing 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 2