Cookies on this website
We use cookies to ensure that we give you the best experience on our website. If you click 'Continue' we'll assume that you are happy to receive all cookies and you won't see this message again. Click 'Find out more' for information on how to change your cookie settings.

Phylogenetic methods typically rely on an appropriate model of how data evolved in order to infer an accurate phylogenetic tree. For molecular data, standard statistical methods have provided an effective strategy for extracting phylogenetic information from aligned sequence data when each site (character) is subject to a common process. However, for other types of data (e.g., morphological data), characters can be too ambiguous, homoplastic, or saturated to develop models that are effective at capturing the underlying process of change. To address this, we examine the properties of a classic but neglected method for inferring splits in an underlying tree, namely, maximum compatibility. By adopting a simple and extreme model in which each character either fits perfectly on some tree, or is entirely random (but it is not known which class any character belongs to) we are able to derive exact and explicit formulae regarding the performance of maximum compatibility. We show that this method is able to identify a set of non-trivial homoplasy-free characters, when the number [Formula: see text] of taxa is large, even when the number of random characters is large. In contrast, we show that a method that makes more uniform use of all the data-maximum parsimony-can provably estimate trees in which none of the original homoplasy-free characters support splits.

Original publication

DOI

10.1093/sysbio/syv008

Type

Journal article

Journal

Syst Biol

Publication Date

05/2015

Volume

64

Pages

492 - 504

Keywords

Character compatibility, homoplasy, parsimony, phylogenetic tree, Classification, Models, Genetic, Phylogeny