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

Fig. 2

From: Treewidth-based algorithms for the small parsimony problem on networks

Fig. 2

Tamaki’s tree-decomposer [23] has a harder time with the right, more tangled instance (50 nodes, 175 edges, treewidth 25 computed in 79s) than with the larger instance on the left (465 nodes, 1004 edges, treewidth 9 computed in 0.5s), illustrating that tangledness is a more important factor than size. Indeed, both instances display a tangledness that already exceeds what we expect to see in real-world phylogenetic networks. The instances are ex065 (right) and ex011 (left) of the PACE2017 challenge [22]

Back to article page