Artículo

Problems with supertrees based on the subtree prune-and-regraft distance, with comments on majority rule supertrees

Goloboff, Pablo Augusto Icon; Szumik, Claudia Adriana Icon

Otros responsables

Fecha

02/2016

Editorial

Wiley Blackwell Publishing, Inc

Revista

Cladistics

Título del libro

Nombre del evento

Fecha del evento

Institución organizadora

ISSN

0748-3007

eISSN

ISBN

Idioma

Inglés

Tipo del evento

Clasificación temática

Palabras clave

Resumen

This paper examines a recent proposal to calculate supertrees by minimizing the sum of subtree prune-and-regraft distances to the input trees. The supertrees thus calculated may display groups present in a minority of the input trees but contradicted by the majority, or groups that are not supported by any input tree or combination of input trees. The proponents of the method themselves stated that these are serious problems of "matrix representation with parsimony", but they can in fact occur in their own method. The majority rule supertrees, being explicitly clade-based, cannot have these problems, and seem much more suited to retrieving common clades from a set of trees with different taxon sets. However, it is dubious that so-called majority rule supertrees can always be interpreted as displaying those clades present (or compatible with) with a majority of the trees. The majority rule consensus is always a median tree, in terms of the Robinson-Foulds distances (i.e. it minimizes the sum of Robinson-Foulds distances to the input trees). In contrast, majority rule supertrees may not be median-different, contradictory trees may minimize Robinson-Foulds distances, while their strict consensus does not. If being "majority" results from being median in Robinson-Foulds distances, this means that in the supertree setting a "majority" is ambiguously defined, sometimes achievable only by mutually contradictory trees.

Colecciones

Aprobación

Revisión

Complementado por

Referenciado por

Licencia Creative Commons

Excepto donde se indique lo contrario, la licencia de este ítem se describe como by-nc-sa