Skip to main content
Fig. 5 | Algorithms for Molecular Biology

Fig. 5

From: Co-linear chaining on pangenome graphs

Fig. 5

A comparison of the size of the computed path cover and the lower bound on the size of the minimum path cover for each component of graphs (a) 10H and (b) 95H. Graph 10H has 30 weakly connected components. Graph 95H has 26 weakly connected components (Table 1)

Back to article page

Algorithms for Molecular Biology

ISSN: 1748-7188