bioRxiv ScienceSearch

Biology subjects

McMahon, M. M.

Publications and source records attributed to McMahon, M. M..

2 recordsLinked to original sources

A new (old) approach to genotype-based phylogenomic inference within species, with an example from the saguaro cactus (Carnegiea gigantea)

AO_SCPLOWBSTRACTC_SCPLOWGenome sequence data are routinely being used to infer phylogenetic history within and between closely related diploid species, but few tree inference methods are specifically tailored to diploid genotype data. Here we re-examine the method of "polymorphism parsimony" (Inger 1967; Farris 1978; Felsenstein 1979), originally introduced to study morphological characters and chromosome inversion polymorphisms, to evaluate its utility for unphased diploid genotype data in large scale phylogenomic data sets. We show that it is equivalent to inferring species trees by minimizing deep coalescences--assuming an infinite sites model. Two potential advantages of this approach are scalability and estimation of a rooted tree. As with some other single nucleotide polymorphism (SNP) based methods, it requires thinning of data sets to statistically independent sites, and we describe a genotype-based test for phylogenetic independence. To evaluate this approach in genome scale data, we construct intraspecific phylogenies for 10 populations of the saguaro cactus using 200 Gbp of resequencing data, and then use these methods to test whether the population with highest genetic diversity corresponds to the root of the genotype trees. Results were highly congruent with the (unrooted) trees obtained using SVDquartets, a scalable alternative method of phylogenomic inference.

evolutionary biology

Terraces in Gene Tree Reconciliation-Based Species Tree Inference

AO_SCPLOWBSTRACTC_SCPLOWTerraces in phylogenetic tree space are sets of trees with identical optimality scores for a given data set, arising from missing data. These were first described for multilocus phylogenetic data sets in the context of maximum parsimony inference and maximum likelihood inference under certain model assumptions. Here we show how the mathematical properties that lead to terraces extend to gene tree - species tree problems in which the gene trees are incomplete. Inference of species trees from either sets of gene family trees subject to duplication and loss, or allele trees subject to incomplete lineage sorting, can exhibit terraces in their solution space. First, we show conditions that lead to a new kind of terrace, which stems from subtree operations that appear in reconciliation problems for incomplete trees. Then we characterize when terraces of both types can occur when the optimality criterion for tree search is based on duplication, loss or deep coalescence scores. Finally, we examine the impact of assumptions about the causes of losses: whether they are due to imperfect sampling or true evolutionary deletion.

evolutionary biology