From Gene Trees to Species Trees II: Species Tree Inference by Minimizing Deep Coalescence Events

2011 ◽  
Vol 8 (6) ◽  
pp. 1685-1691 ◽  
Author(s):  
Louxin Zhang
Keyword(s):  
Species Tree ◽  
Gene Trees ◽  
Species Trees ◽  
Deep Coalescence ◽  
Tree Inference ◽  
Species Tree Inference

scholarly journals ASTRAL-Pro: quartet-based species tree inference despite paralogy

2019 ◽  
Author(s):  
Chao Zhang ◽  
Celine Scornavacca ◽  
Erin K. Molloy ◽  
Siavash Mirarab
Keyword(s):  
Gene Duplication ◽  
Gene Loss ◽  
Incomplete Lineage Sorting ◽  
Single Copy ◽  
Species Tree ◽  
Alternative Methods ◽  
Gene Trees ◽  
Species Trees ◽  
Tree Inference ◽  
Species Tree Inference

AbstractSpecies tree inference via summary methods that combine gene trees has become an increasingly common analysis in recent phylogenomic studies. This broad adoption has been partly due to the greater availability of genome-wide data and ample recognition that gene trees and species trees can differ due to biological processes such as gene duplication and gene loss. This increase has also been encouraged by the recent development of accurate and scalable summary methods, such as ASTRAL. However, most of these methods, including ASTRAL, can only handle single-copy gene trees and do not attempt to model gene duplication and gene loss. In this paper, we introduce a measure of quartet similarity between single-copy and multi-copy trees (accounting for orthology and paralogy relationships) that can be optimized via a scalable dynamic programming similar to the one used by ASTRAL. We then present a new quartet-based species tree inference method: ASTRAL-Pro (ASTRAL for PaRalogs and Orthologs). By studying its performance on an extensive collection of simulated datasets and on a real plant dataset, we show that ASTRAL-Pro is more accurate than alternative methods when gene trees differ from the species tree due to the simultaneous presence of gene duplication, gene loss, incomplete lineage sorting, and estimation errors.

scholarly journals Analyzing contentious relationships and outlier genes in phylogenomics

2017 ◽  
Author(s):  
Joseph F. Walker ◽  
Joseph W. Brown ◽  
Stephen A. Smith
Keyword(s):  
Incomplete Lineage Sorting ◽  
Species Tree ◽  
Gene Trees ◽  
Species Trees ◽  
Lineage Sorting ◽  
Tree Inference ◽  
Small Set ◽  
Tree Methods ◽  
Edge Based ◽  
Species Tree Inference

ABSTRACTRecent studies have demonstrated that conflict is common among gene trees in phylogenomic studies, and that less than one percent of genes may ultimately drive species tree inference in supermatrix analyses. Here, we examined two datasets where supermatrix and coalescent-based species trees conflict. We identified two highly influential “outlier” genes in each dataset. When removed from each dataset, the inferred supermatrix trees matched the topologies obtained from coalescent analyses. We also demonstrate that, while the outlier genes in the vertebrate dataset have been shown in a previous study to be the result of errors in orthology detection, the outlier genes from a plant dataset did not exhibit any obvious systematic error and therefore may be the result of some biological process yet to be determined. While topological comparisons among a small set of alternate topologies can be helpful in discovering outlier genes, they can be limited in several ways, such as assuming all genes share the same topology. Coalescent species tree methods relax this assumption but do not explicitly facilitate the examination of specific edges. Coalescent methods often also assume that conflict is the result of incomplete lineage sorting (ILS). Here we explored a framework that allows for quickly examining alternative edges and support for large phylogenomic datasets that does not assume a single topology for all genes. For both datasets, these analyses provided detailed results confirming the support for coalescent-based topologies. This framework suggests that we can improve our understanding of the underlying signal in phylogenomic datasets by asking more targeted edge-based questions.

scholarly journals Impact of Ghost Introgression on Coalescent-based Species Tree Inference and Estimation of Divergence Time

2022 ◽  
Author(s):  
XiaoXu Pang ◽  
Da-Yong Zhang
Keyword(s):  
Incomplete Lineage Sorting ◽  
Divergence Time ◽  
Species Tree ◽  
Gene Trees ◽  
Species Trees ◽  
Lineage Sorting ◽  
Multispecies Coalescent ◽  
Tree Inference ◽  
Tree Methods ◽  
The Impact

The species studied in any evolutionary investigation generally constitute a very small proportion of all the species currently existing or that have gone extinct. It is therefore likely that introgression, which is widespread across the tree of life, involves "ghosts," i.e., unsampled, unknown, or extinct lineages. However, the impact of ghost introgression on estimations of species trees has been rarely studied and is thus poorly understood. In this study, we use mathematical analysis and simulations to examine the robustness of species tree methods based on a multispecies coalescent model under gene flow sourcing from an extant or ghost lineage. We found that very low levels of extant or ghost introgression can result in anomalous gene trees (AGTs) on three-taxon rooted trees if accompanied by strong incomplete lineage sorting (ILS). In contrast, even massive introgression, with more than half of the recipient genome descending from the donor lineage, may not necessarily lead to AGTs. In cases involving an ingroup lineage (defined as one that diverged no earlier than the most basal species under investigation) acting as the donor of introgression, the time of root divergence among the investigated species was either underestimated or remained unaffected, but for the cases of outgroup ghost lineages acting as donors, the divergence time was generally overestimated. Under many conditions of ingroup introgression, the stronger the ILS was, the higher was the accuracy of estimating the time of root divergence, although the topology of the species tree is more prone to be biased by the effect of introgression.

scholarly journals SpeciesRax: A tool for maximum likelihood species tree inference from gene family trees under duplication, transfer, and loss.

2021 ◽  
Author(s):  
Benoit Morel ◽  
Paul Schade ◽  
Sarah Lutteropp ◽  
Tom A. Williams ◽  
Gergely J. Szöllösi ◽  
...  
Keyword(s):  
Maximum Likelihood ◽  
Gene Family ◽  
Gene Families ◽  
Species Tree ◽  
Likelihood Method ◽  
Gene Trees ◽  
Informative Signal ◽  
Tree Inference ◽  
Species Tree Inference ◽  
Family Trees

Species tree inference from gene family trees is becoming increasingly popular because it can account for discordance between the species tree and the corresponding gene family trees. In particular, methods that can account for multiple-copy gene families exhibit potential to leverage paralogy as informative signal. At present, there does not exist any widely adopted inference method for this purpose. Here, we present SpeciesRax, the first maximum likelihood method that can infer a rooted species tree from a set of gene family trees and can account for gene duplication, loss, and transfer events. By explicitly modelling events by which gene trees can depart from the species tree, SpeciesRax leverages the phylogenetic rooting signal in gene trees. SpeciesRax infers species tree branch lengths in units of expected substitutions per site and branch support values via paralogy-aware quartets extracted from the gene family trees. Using both empirical and simulated datasets we show that SpeciesRax is at least as accurate as the best competing methods while being one order of magnitude faster on large datasets at the same time. We used SpeciesRax to infer a biologically plausible rooted phylogeny of the vertebrates comprising $188$ species from $31612$ gene families in one hour using $40$ cores. SpeciesRax is available under GNU GPL at https://github.com/BenoitMorel/GeneRax and on BioConda.

scholarly journals Phylogenetic conflicts, combinability, and deep phylogenomics in plants

2018 ◽  
Author(s):  
Stephen A. Smith ◽  
Nathanael Walker-Hale ◽  
Joseph F. Walker ◽  
Joseph W. Brown
Keyword(s):  
Phylogenetic Relationships ◽  
Phylogenetic Signal ◽  
Gene Tree ◽  
Species Tree ◽  
Gene Trees ◽  
Data Filtering ◽  
Tree Inference ◽  
Tree Methods ◽  
Inference Methods ◽  
Species Tree Inference

AbstractStudies have demonstrated that pervasive gene tree conflict underlies several important phylogenetic relationships where different species tree methods produce conflicting results. Here, we present a means of dissecting the phylogenetic signal for alternative resolutions within a dataset in order to resolve recalcitrant relationships and, importantly, identify what the dataset is unable to resolve. These procedures extend upon methods for isolating conflict and concordance involving specific candidate relationships and can be used to identify systematic error and disambiguate sources of conflict among species tree inference methods. We demonstrate these on a large phylogenomic plant dataset. Our results support the placement of Amborella as sister to the remaining extant angiosperms, Gnetales as sister to pines, and the monophyly of extant gymnosperms. Several other contentious relationships, including the resolution of relationships within the bryophytes and the eudicots, remain uncertain given the low number of supporting gene trees. To address whether concatenation of filtered genes amplified phylogenetic signal for relationships, we implemented a combinatorial heuristic to test combinability of genes. We found that nested conflicts limited the ability of data filtering methods to fully ameliorate conflicting signal amongst gene trees. These analyses confirmed that the underlying conflicting signal does not support broad concatenation of genes. Our approach provides a means of dissecting a specific dataset to address deep phylogenetic relationships while also identifying the inferential boundaries of the dataset.

scholarly journals Phylogenomic terraces: presence and implication in species tree estimation from gene trees

2020 ◽  
Author(s):  
Ishrat Tanzila Farah ◽  
Md Muktadirul Islam ◽  
Kazi Tasnim Zinat ◽  
Atif Hasan Rahman ◽  
Md Shamsuzzoha Bayzid
Keyword(s):  
Incomplete Lineage Sorting ◽  
Gene Tree ◽  
Species Tree ◽  
Gene Trees ◽  
Species Trees ◽  
Lineage Sorting ◽  
Deep Coalescence ◽  
Tree Estimation ◽  
Tree Space ◽  
Multiple Species

AbstractSpecies tree estimation from multi-locus dataset is extremely challenging, especially in the presence of gene tree heterogeneity across the genome due to incomplete lineage sorting (ILS). Summary methods have been developed which estimate gene trees and then combine the gene trees to estimate a species tree by optimizing various optimization scores. In this study, we have formalized the concept of “phylogenomic terraces” in the species tree space, where multiple species trees with distinct topologies may have exactly the same optimization score (quartet score, extra lineage score, etc.) with respect to a collection of gene trees. We investigated the presence and implication of terraces in species tree estimation from multi-locus data by taking ILS into account. We analyzed two of the most popular ILS-aware optimization criteria: maximize quartet consistency (MQC) and minimize deep coalescence (MDC). Methods based on MQC are provably statistically consistent, whereas MDC is not a consistent criterion for species tree estimation. Our experiments, on a collection of dataset simulated under ILS, indicate that MDC-based methods may achieve competitive or identical quartet consistency score as MQC but could be significantly worse than MQC in terms of tree accuracy – demonstrating the presence and affect of phylogenomic terraces. This is the first known study that formalizes the concept of phylogenomic terraces in the context of species tree estimation from multi-locus data, and reports the presence and implications of terraces in species tree estimation under ILS.

scholarly journals Practical Speedup of Bayesian Inference of Species Phylogenies by Restricting the Space of Gene Trees

2019 ◽  
Author(s):  
Yaxuan Wang ◽  
Huw A. Ogilvie ◽  
Luay Nakhleh
Keyword(s):  
Bayesian Inference ◽  
Species Tree ◽  
Biological Data ◽  
Small Data ◽  
Data Sets ◽  
Gene Trees ◽  
Multispecies Coalescent ◽  
Tree Inference ◽  
The Individual ◽  
Species Tree Inference

AbstractSpecies tree inference from multi-locus data has emerged as a powerful paradigm in the post-genomic era, both in terms of the accuracy of the species tree it produces as well as in terms of elucidating the processes that shaped the evolutionary history. Bayesian methods for species tree inference are desirable in this area as they have been shown to yield accurate estimates, but also to naturally provide measures of confidence in those estimates. However, the heavy computational requirements of Bayesian inference have limited the applicability of such methods to very small data sets.In this paper, we show that the computational efficiency of Bayesian inference under the multispecies coalescent can be improved in practice by restricting the space of the gene trees explored during the random walk, without sacrificing accuracy as measured by various metrics. The idea is to first infer constraints on the trees of the individual loci in the form of unresolved gene trees, and then to restrict the sampler to consider only resolutions of the constrained trees. We demonstrate the improvements gained by such an approach on both simulated and biological data.

scholarly journals Practical Speedup of Bayesian Inference of Species Phylogenies by Restricting the Space of Gene Trees

2020 ◽  
Vol 37 (6) ◽  
pp. 1809-1818
Author(s):  
Yaxuan Wang ◽  
Huw A Ogilvie ◽  
Luay Nakhleh
Keyword(s):  
Bayesian Inference ◽  
Species Tree ◽  
Biological Data ◽  
Small Data ◽  
Data Sets ◽  
Gene Trees ◽  
Multispecies Coalescent ◽  
Tree Inference ◽  
The Individual ◽  
Species Tree Inference

Abstract Species tree inference from multilocus data has emerged as a powerful paradigm in the postgenomic era, both in terms of the accuracy of the species tree it produces as well as in terms of elucidating the processes that shaped the evolutionary history. Bayesian methods for species tree inference are desirable in this area as they have been shown not only to yield accurate estimates, but also to naturally provide measures of confidence in those estimates. However, the heavy computational requirements of Bayesian inference have limited the applicability of such methods to very small data sets. In this article, we show that the computational efficiency of Bayesian inference under the multispecies coalescent can be improved in practice by restricting the space of the gene trees explored during the random walk, without sacrificing accuracy as measured by various metrics. The idea is to first infer constraints on the trees of the individual loci in the form of unresolved gene trees, and then to restrict the sampler to consider only resolutions of the constrained trees. We demonstrate the improvements gained by such an approach on both simulated and biological data.

Consensus properties and their large-scale applications for the gene duplication problem

2016 ◽  
Vol 14 (03) ◽  
pp. 1642005 ◽  
Author(s):  
Jucheol Moon ◽  
Harris T. Lin ◽  
Oliver Eulenstein
Keyword(s):  
Gene Duplication ◽  
Large Scale ◽  
Species Tree ◽  
Gene Duplications ◽  
Gene Trees ◽  
Scalable Algorithm ◽  
All Solutions ◽  
Tree Inference ◽  
Minimum Number ◽  
Species Tree Inference

Solving the gene duplication problem is a classical approach for species tree inference from gene trees that are confounded by gene duplications. This problem takes a collection of gene trees and seeks a species tree that implies the minimum number of gene duplications. Wilkinson et al. posed the conjecture that the gene duplication problem satisfies the desirable Pareto property for clusters. That is, for every instance of the problem, all clusters that are commonly present in the input gene trees of this instance, called strict consensus, will also be found in every solution to this instance. We prove that this conjecture does not generally hold. Despite this negative result we show that the gene duplication problem satisfies a weaker version of the Pareto property where the strict consensus is found in at least one solution (rather than all solutions). This weaker property contributes to our design of an efficient scalable algorithm for the gene duplication problem. We demonstrate the performance of our algorithm in analyzing large-scale empirical datasets. Finally, we utilize the algorithm to evaluate the accuracy of standard heuristics for the gene duplication problem using simulated datasets.

scholarly journals SODA: Multi-locus species delimitation using quartet frequencies

2019 ◽  
Author(s):  
Maryam Rabiee ◽  
Siavash Mirarab
Keyword(s):  
Species Delimitation ◽  
Branch Length ◽  
Large Datasets ◽  
Species Tree ◽  
Gene Trees ◽  
Species Trees ◽  
Very Large Datasets ◽  
Tree Inference ◽  
Group A ◽  
Tree Estimation

AbstractMotivationSpecies delimitation, the process of deciding how to group a set of organisms into units called species, is one of the most challenging problems in evolutionary computational biology. While many methods exist for species delimitation, most based on the coalescent theory, few are scalable to very large datasets and methods that scale tend to be not accurate. Species delimitation is closely related to species tree inference from discordant gene trees, a problem that has enjoyed rapid advances in recent years.ResultsIn this paper, we build on the accuracy and scalability of recent quartet-based methods for species tree estimation and propose a new method called SODA for species delimitation. SODA relies heavily on a recently developed method for testing zero branch length in species trees. In extensive simulations, we show that SODA can easily scale to very large datasets while maintaining high accuracy.AvailabilityThe code and data presented here are available on https://github.com/maryamrabiee/[email protected]

Sign in / Sign up

Export Citation Format

Share Document