Fig. 4From: Infrared: a declarative tree decomposition-powered framework for bioinformaticsExample phylogenetic network. Optimal solutions for A hardwired parsimony. B softwired parsimony. C parental parsimony; nodes are labeled by character sets. The input for these problems consists of the network and the labels of only the leaves (blue).The other labels are inferred. The example contains one reticulation node (red)Back to article page