For each dataset we performed a heuristic parsimony search using a set of 1000 random taxon-addition starting trees, tree bisection–reconnection branch swapping,with Multrees on, limiting the arrangements to 100,000 and permitting only one tree to be held in each step.