Minority rule supertrees? MRP, Compatibility, and Minimum Flip may display the least frequent groups

New examples are presented, showing that supertree methods such as matrix representation with parsimony, minimum flip trees, and compatibility analysis of the matrix representing the input trees, produce supertrees that cannot be interpreted as displaying the groups present in the majority of the input trees. These methods may produce a supertree displaying some groups present in the minority of the trees, and contradicted by the majority. Of the three methods, compatibility analysis is the least used, but it seems to be the one that differs the least from majority rule consensus. The three methods are similar in that they choose the supertree(s) that best fit the set of input trees (quantified as some measure of the fit to the matrix representation of the input trees); in the case of complete trees, it is argued that, for a supertree method to be equivalent to majority rule or frequency difference consensus, two necessary (but not sufficient) conditions must be met. First, the measure of fit between a supertree and an input tree must be symmetrical. Second, the fit for a character representing a group must be measured as absolute: either it fits or it does not fit. In the restricted case of complete and equally resolved input trees, compatibility analysis (unlike MRP and minimum flipping) fulfils these two conditions: it is symmetrical (i.e., as long as the trees have the same taxon sets and are equally resolved, the number of characters in the matrix representation of tree A that require homoplasy in tree B is always the same as the number of characters in the matrix representation of tree B that require homoplasy in tree A) and it measures fit as all‐or‐none. In the case of just two complete and equally resolved input trees, the two conditions (symmetry and absolute fit) are necessary and sufficient, which explains why the compatibility analysis of such trees behaves as majority consensus. With more than two such trees, these conditions are still necessary but no longer sufficient for the equivalence; in such cases, the compatibility supertree may differ significantly from the majority rule consensus, even when these conditions apply (as shown by example). MRP and minimum flipping are asymmetric and measure various degrees of fit for each character, which explains why they often behave very differently from majority rule procedures, and why they are very likely to have groups contradicted by each of the input trees, or groups supported by a minority of the input trees.

[1]  Oliver Eulenstein,et al.  The shape of supertrees to come: tree shape related properties of fourteen supertree methods. , 2005, Systematic biology.

[2]  Allen G. Rodrigo,et al.  An Assessment of Matrix Representation with Compatibility in Supertree Construction , 2004 .

[3]  M. Ragan,et al.  Reply to A. G. Rodrigo's "A Comment on Baum's Method for Combining Phylogenetic Trees" , 1993 .

[4]  P. Goloboff Analyzing Large Data Sets in Reasonable Times: Solutions for Composite Optima , 1999, Cladistics : the international journal of the Willi Hennig Society.

[5]  Pablo A. Goloboff,et al.  CHARACTER OPTIMIZATION AND CALCULATION OF TREE LENGTHS , 1993 .

[6]  K. Nixon The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis , 1999 .

[7]  G. Giribet,et al.  TNT: Tree Analysis Using New Technology , 2005 .

[8]  P. Goloboff,et al.  Areas of endemism: an improved optimality criterion. , 2004, Systematic Biology.

[9]  J. Farris,et al.  PARSIMONY JACKKNIFING OUTPERFORMS NEIGHBOR‐JOINING , 1996, Cladistics : the international journal of the Willi Hennig Society.

[10]  Olaf R. P. Bininda-Emonds MRP supertree construction in the consensus setting , 2001, Bioconsensus.

[11]  Atte Moilanen,et al.  Searching for Most Parsimonious Trees with Simulated Evolutionary Optimization , 1999 .

[12]  P. Goloboff METHODS FOR FASTER PARSIMONY ANALYSIS , 1996 .

[13]  David Fernández-Baca,et al.  Performance of flip supertree construction with a heuristic algorithm. , 2004, Systematic biology.

[14]  J. L. Gittleman,et al.  Building large trees by combining phylogenetic information: a complete phylogeny of the extant Carnivora (Mammalia) , 1999, Biological reviews of the Cambridge Philosophical Society.

[15]  M. Ragan Phylogenetic inference based on matrix representation of trees. , 1992, Molecular phylogenetics and evolution.

[16]  E. -,et al.  Properties of Matrix Representation with Parsimony Analyses , 2000 .

[17]  P. Goloboff,et al.  An optimality criterion to determine areas of endemism. , 2002, Systematic biology.

[18]  J. L. Gittleman,et al.  The (Super)Tree of Life: Procedures, Problems, and Prospects , 2002 .

[19]  Norman I. Platnick,et al.  CHARACTER OPTIMIZATION AND WEIGHTING: DIFFERENCES BETWEEN THE STANDARD AND THREE‐TAXON APPROACHES TO PHYLOGENETIC INFERENCE , 1993, Cladistics : the international journal of the Willi Hennig Society.

[20]  James O. McInerney,et al.  Some Desiderata for Liberal Supertrees , 2004 .

[21]  P. Goloboff ESTIMATING CHARACTER WEIGHTS DURING TREE SEARCH , 1993, Cladistics : the international journal of the Willi Hennig Society.

[22]  O. Bininda-Emonds,et al.  The evolution of supertrees. , 2004, Trends in ecology & evolution.

[23]  O. Bininda-Emonds,et al.  Trees versus characters and the supertree/supermatrix "paradox". , 2004, Systematic biology.

[24]  K. Nixon,et al.  The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis , 1999, Cladistics : the international journal of the Willi Hennig Society.

[25]  B. Baum Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees , 1992 .

[26]  Diego Pol,et al.  Semi‐strict supertrees , 2002, Cladistics : the international journal of the Willi Hennig Society.

[27]  J. Farris The Logical Basis of Phylogenetic Analysis , 2004 .

[28]  O. Bininda-Emonds,et al.  Novel versus unsupported clades: assessing the qualitative support for clades in MRP supertrees. , 2003, Systematic biology.

[29]  Charles Semple,et al.  A supertree method for rooted trees , 2000, Discret. Appl. Math..

[30]  David Fernández-Baca,et al.  Flipping: A supertree construction method , 2001, Bioconsensus.

[31]  Juan J. Morrone,et al.  On the Identification of Areas of Endemism , 1994 .

[32]  John Gatesy,et al.  Inconsistencies in arguments for the supertree approach: supermatrices versus supertrees of Crocodylia. , 2004, Systematic biology.