Fig. 3
From: Dollo-CDP: a polynomial-time algorithm for the clade-constrained large Dollo parsimony problem
Subfigure A shows the tree returned by Dollo-CDP-char for the Myotis data set [22]. This is the same tree recovered by branch-and-bound. Subfigure B shows the tree returned by Dollo-CDP-char for the Palaeognathae data set [17]. A branch-and-bound analysis recovered 60 optimal trees (the Dollo-CDP tree is one of the 60). The three branches highlighted in red indicate the strict consensus of the 60 equally optimal trees