Rooting with Multiple Outgroups: Consensus Versus Parsimony

Abstract

Using outgroup(s) is the most frequent method to root trees. Rooting through unconstrained simultaneous analysis of several outgroups is a favoured option because it serves as a test of the supposed monophyly of the ingroup. When contradiction occurs among the characters of the outgroups, the branching pattern of basal nodes of the rooted tree is dependent on the order of the outgroups listed in the data matrix, that is, on the prime outgroup (even in the case of exhaustive search). Different equally parsimonious rooted trees (=cladograms) can be obtained by permutation of prime outgroups. An alternative to a common implicit practice (select one outgroup to orientate the tree) is that the accepted cladogram is the strict consensus of the different equally parsimonious rooted trees. The consensus tree is less parsimonious but is not hampered with extra assumption such as the choice of one outgroup (or more) among the initial number of outgroup terminals. It also does not show sister-group relations that are ambiguously resolved or not resolved at all.