Fig. 5From: Treewidth-based algorithms for the small parsimony problem on networksThe tree decomposition \((\Gamma , B)\) for the network N given in Fig. 3 constructed in the “\(\ge \)”-part of Lemma 1. Leaves are represented by boxes instead of their names. Note that \((\Gamma ,B)\) is not a nice tree decompositionBack to article page