Skip to main content


Figure 3 | Algorithms for Molecular Biology

Figure 3

From: A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs

Figure 3

Running times comparison. Running times of Algorithm 1 and of the Kissplice algorithm [6] for all the BCCs with more than 150 vertices. Each graph a, b, c and d shows the running time of both algorithms for \(\alpha _1 = 250, 500, 750\) and \(1{,}000\), respectively. The BCCs where both algorithms reach the timeout were omitted from the plots to improve the visualization. For \(\alpha _1 =\) 250, 500, 750 and 1,000 there are 1, 2, 3 and 3 BCCs omitted, respectively.

Back to article page