Figure 4From: A graph-theoretic approach for inparalog detectionComparison of the performance of the 2/3-approximation algorithm and the heuristic. The results are averaged over 100 random graphs of 2500 vertices (genes) and 5 colors (genomes). Left: Comparison of the number of uncovered vertices. The number of odd-length alternating paths is also shown. Right: Running time comparison.Back to article page