scholarly journals Inference of Species Phylogenies from Bi-allelic Markers Using Pseudo-likelihood

2018 ◽  
Author(s):  
Jiafan Zhu ◽  
Luay Nakhleh
Keyword(s):  
Network Inference ◽  
Sequence Data ◽  
Phylogenetic Network ◽  
Simulated Data ◽  
Biological Data ◽  
Phylogenetic Networks ◽  
Gene Trees ◽  
Multispecies Coalescent ◽  
Pseudo Likelihood ◽  
Computational Bottleneck

AbstractMotivationPhylogenetic networks represent reticulate evolutionary histories. Statistical methods for their inference under the multispecies coalescent have recently been developed. A particularly powerful approach uses data that consist of bi-allelic markers (e.g., single nucleotide polymorphism data) and allows for exact likelihood computations of phylogenetic networks while numerically integrating over all possible gene trees per marker. While the approach has good accuracy in terms of estimating the network and its parameters, likelihood computations remain a major computational bottleneck and limit the method’s applicability.ResultsIn this paper, we first demonstrate why likelihood computations of networks take orders of magnitude more time when compared to trees. We then propose an approach for inference of phylo-genetic networks based on pseudo-likelihood using bi-allelic markers. We demonstrate the scalability and accuracy of phylogenetic network inference via pseudo-likelihood computations on simulated data. Furthermore, we demonstrate aspects of robustness of the method to violations in the underlying assumptions of the employed statistical model. Finally, we demonstrate the application of the method to biological data. The proposed method allows for analyzing larger data sets in terms of the numbers of taxa and reticulation events. While pseudo-likelihood had been proposed before for data consisting of gene trees, the work here uses sequence data directly, offering several advantages as we discuss.AvailabilityThe methods have been implemented in PhyloNet (http://bioinfocs.rice.edu/phylonet)[email protected], [email protected]

scholarly journals Maximum Parsimony Inference of Phylogenetic Networks in the Presence of Polyploid Complexes

2020 ◽  
Author(s):  
Zhi Yan ◽  
Zhen Cao ◽  
Yushu Liu ◽  
Luay Nakhleh
Keyword(s):  
Network Inference ◽  
Incomplete Lineage Sorting ◽  
Phylogenetic Network ◽  
Biological Data ◽  
Phylogenetic Networks ◽  
Data Sets ◽  
Gene Trees ◽  
Polyploid Species ◽  
Lineage Sorting ◽  
Work Done

AbstractPhylogenetic networks provide a powerful framework for modeling and analyzing reticulate evolutionary histories. While polyploidy has been shown to be prevalent not only in plants but also in other groups of eukaryotic species, most work done thus far on phylogenetic network inference assumes diploid hybridization. These inference methods have been applied, with varying degrees of success, to data sets with polyploid species, even though polyploidy violates the mathematical assumptions underlying these methods. Statistical methods were developed recently for handling specific types of polyploids and so were parsimony methods that could handle polyploidy more generally yet while excluding processes such as incomplete lineage sorting. In this paper, we introduce a new method for inferring most parsimonious phylogenetic networks on data that include polyploid species. Taking gene trees as input, the method seeks a phylogenetic network that minimizes deep coalescences while accounting for polyploidy. The method could also infer trees, thus potentially distinguishing between auto- and allo-polyploidy. We demonstrate the performance of the method on both simulated and biological data. The inference method as well as a method for evaluating given phylogenetic networks are implemented and publicly available in the PhyloNet software package.

scholarly journals Co-estimating Reticulate Phylogenies and Gene Trees from Multi-locus Sequence Data

2016 ◽  
Author(s):  
Dingqiao Wen ◽  
Luay Nakhleh
Keyword(s):  
Gene Flow ◽  
Incomplete Lineage Sorting ◽  
Phylogenetic Network ◽  
Simulated Data ◽  
Biological Data ◽  
Generative Model ◽  
Divergence Times ◽  
Gene Trees ◽  
Lineage Sorting ◽  
Coalescence Times

AbstractThe multispecies network coalescent (MSNC) is a stochastic process that captures how gene trees grow within the branches of a phylogenetic network. Coupling the MSNC with a stochastic mutational process that operates along the branches of the gene trees gives rise to a generative model of how multiple loci from within and across species evolve in the presence of both incomplete lineage sorting (ILS) and reticulation (e.g., hybridization). We report on a Bayesian method for sampling the parameters of this generative model, including the species phylogeny, gene trees, divergence times, and population sizes, from DNA sequences of multiple independent loci. We demonstrate the utility of our method by analyzing simulated data and reanalyzing three biological data sets. Our results demonstrate the significance of not only co-estimating species phylogenies and gene trees, but also accounting for reticulation and ILS simultaneously. In particular, we show that when gene flow occurs, our method accurately estimates the evolutionary histories, coalescence times, and divergence times. Tree inference methods, on the other hand, underestimate divergence times and overestimate coalescence times when the evolutionary history is reticulate. While the MSNC corresponds to an abstract model of “intermixture,” we study the performance of the model and method on simulated data generated under a gene flow model. We show that the method accurately infers the most recent time at which gene flow occurs. Finally, we demonstrate the application of the new method to a 106-locus yeast data set. [Multispecies network coalescent; reticulation; incomplete lineage sorting; phylogenetic network; Bayesian inference; RJMCMC.]

scholarly journals A Divide-and-Conquer Method for Scalable Phylogenetic Network Inference from Multi-locus Data

2019 ◽  
Author(s):  
Jiafan Zhu ◽  
Xinhao Liu ◽  
Huw A. Ogilvie ◽  
Luay K. Nakhleh
Keyword(s):  
Large Scale ◽  
Network Inference ◽  
Incomplete Lineage Sorting ◽  
Phylogenetic Network ◽  
Biological Data ◽  
Phylogenetic Networks ◽  
Divide And Conquer ◽  
Lineage Sorting ◽  
Step Method ◽  
Sequence Alignments

AbstractReticulate evolutionary histories, such as those arising in the presence of hybridization, are best modeled as phylogenetic networks. Recently developed methods allow for statistical inference of phylogenetic networks while also accounting for other processes, such as incomplete lineage sorting (ILS). However, these methods can only handle a small number of loci from a handful of genomes.In this paper, we introduce a novel two-step method for scalable inference of phylogenetic networks from the sequence alignments of multiple, unlinked loci. The method infers networks on subproblems and then merges them into a network on the full set of taxa. To reduce the number of trinets to infer, we formulate a Hitting Set version of the problem of finding a small number of subsets, and implement a simple heuristic to solve it. We studied their performance, in terms of both running time and accuracy, on simulated as well as on biological data sets. The two-step method accurately infers phylogenetic networks at a scale that is infeasible with existing methods. The results are a significant and promising step towards accurate, large-scale phylogenetic network inference.We implemented the algorithms in the publicly available software package PhyloNet (https://bioinfocs.rice.edu/PhyloNet)[email protected]

scholarly journals On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo

2020 ◽  
Author(s):  
Rabier Charles-Elie ◽  
Berry Vincent ◽  
Glaszmann Jean-Christophe ◽  
Pardi Fabio ◽  
Scornavacca Celine
Keyword(s):  
Network Inference ◽  
Crop Improvement ◽  
Phylogenetic Network ◽  
Genomic Data ◽  
Phylogenetic Networks ◽  
Data Set ◽  
Coalescent Model ◽  
Multispecies Coalescent ◽  
Model Complex ◽  
Hybridization And Introgression

AbstractFor various species, high quality sequences and complete genomes are nowadays available for many individuals. This makes data analysis challenging, as methods need not only to be accurate, but also time efficient given the tremendous amount of data to process. In this article, we introduce an efficient method to infer the evolutionary history of individuals under the multispecies coalescent model in networks (MSNC). Phylogenetic networks are an extension of phylogenetic trees that can contain reticulate nodes, which allow to model complex biological events such as horizontal gene transfer, hybridization, introgression and recombination. We present a novel way to compute the likelihood of biallelic markers sampled along genomes whose evolution involved such events. This likelihood computation is at the heart of a Bayesian network inference method called SnappNet, as it extends the Snapp method [1] inferring evolutionary trees under the multispecies coalescent model, to networks. SnappNet is available as a package of the well-known beast 2 software.Recently, the MCMCBiMarkers method [2] also extended Snapp to networks. Both methods take biallelic markers as input, rely on the same model of evolution and sample networks in a Bayesian framework, though using different methods for computing priors. However, SnappNet relies on algorithms that are exponentially more time-efficient on non-trivial networks. Using extensive simulations, we compare performances of SnappNet and MCMCBiMarkers. We show that both methods enjoy similar abilities to recover simple networks, but SnappNet is more accurate than MCMCBiMarkers on more complex network scenarios. Also, on complex networks, SnappNet is found to be extremely faster than MCMCBiMarkers in terms of time required for the likelihood computation. We finally illustrate SnappNet performances on a rice data set. SnappNet infers a scenario that is compatible with simpler schemes proposed so far and provides additional understanding of rice evolution.Author summaryNowadays, to make the best use of the vast amount of genomic data at our disposal, there is a real need for methods able to model complex biological mechanisms such as hybridization and introgression. Understanding such mechanisms can help geneticists to elaborate strategies in crop improvement that may help reducing poverty and dealing with climate change. However, reconstructing such evolution scenarios is challenging. Indeed, the inference of phylogenetic networks, which explicitly model reticulation events such as hybridization and introgression, requires high computational resources. Then, on large data sets, biologists generally deduce reticulation events indirectly using species tree inference tools.In this context, we present a new Bayesian method, called SnappNet, dedicated to phylogenetic network inference. Our method is competitive in terms of execution speed with respect to its competitors. This speed gain enables us to consider more complex evolution scenarios during Bayesian analyses. When applied to rice genomic data, SnappNet suggested a new evolution scenario, compatible with the existing ones: it posits cAus as the result of an early combination between the Indica and Japonica lineages, followed by a later combination between the cAus and Japonica lineages to derive cBasmati. This accounts for the well-documented wide hybrid compatibility of cAus.

scholarly journals Maximum Parsimony Inference of Phylogenetic Networks in the Presence of Polyploid Complexes

2021 ◽  
Author(s):  
Zhi Yan ◽  
Zhen Cao ◽  
Yushu Liu ◽  
Huw A Ogilvie ◽  
Luay Nakhleh
Keyword(s):  
Network Inference ◽  
Incomplete Lineage Sorting ◽  
Gene Tree ◽  
Phylogenetic Network ◽  
Biological Data ◽  
Phylogenetic Networks ◽  
Data Sets ◽  
Polyploid Species ◽  
Lineage Sorting ◽  
Work Done

Abstract Phylogenetic networks provide a powerful framework for modeling and analyzing reticulate evolutionary histories. While polyploidy has been shown to be prevalent not only in plants but also in other groups of eukaryotic species, most work done thus far on phylogenetic network inference assumes diploid hybridization. These inference methods have been applied, with varying degrees of success, to data sets with polyploid species, even though polyploidy violates the mathematical assumptions underlying these methods. Statistical methods were developed recently for handling specific types of polyploids and so were parsimony methods that could handle polyploidy more generally yet while excluding processes such as incomplete lineage sorting. In this paper, we introduce a new method for inferring most parsimonious phylogenetic networks on data that include polyploid species. Taking gene tree topologies as input, the method seeks a phylogenetic network that minimizes deep coalescences while accounting for polyploidy. We demonstrate the performance of the method on both simulated and biological data. The inference method as well as a method for evaluating evolutionary hypotheses in the form of phylogenetic networks are implemented and publicly available in the PhyloNet software package.

scholarly journals TREEasy: an automated workflow to infer gene trees, species trees, and phylogenetic networks from multilocus data

2019 ◽  
Author(s):  
Yafei Mao ◽  
Siqing Hou ◽  
Evan P. Economo
Keyword(s):  
Tree Species ◽  
Network Inference ◽  
Gene Tree ◽  
Phylogenetic Network ◽  
Handling Time ◽  
Phylogenetic Networks ◽  
Recent Analysis ◽  
Gene Trees ◽  
Species Trees ◽  
Tree Inference

AbstractMultilocus genomic datasets can be used to infer a rich set of information about the evolutionary history of a lineage, including gene trees, species trees, and phylogenetic networks. However, user-friendly tools to run such integrated analyses are lacking, and workflows often require tedious reformatting and handling time to shepherd data through a series of individual programs. Here, we present a tool written in Python—TREEasy—that performs automated sequence alignment (with MAFFT), gene tree inference (with IQ-Tree), species inference from concatenated data (with IQ-Tree), species tree inference from gene trees (with ASTRAL, MP-EST, and STELLS2), and phylogenetic network inference (with SNaQ and PhyloNet). The tool only requires FASTA files and nine parameters as inputs. The Tool can be run as command line or through a Graphical User Interface (GUI). As examples, we reproduced a recent analysis of staghorn coral evolution, and performed a new analysis on the evolution of the WGD clade of yeast. The latter revealed novel inferences that were not identified by previous analyses. TREEasy represents a reliable and simple tool to accelerate research in systematic biology (https://github.com/MaoYafei/TREEasy).

scholarly journals Ranking top-k trees in tree-based phylogenetic networks

2019 ◽  
Author(s):  
Momoko Hayamizu ◽  
Kazuhisa Makino
Keyword(s):  
Optimal Algorithm ◽  
Linear Time ◽  
Fundamental Problem ◽  
Phylogenetic Network ◽  
Reticulate Evolution ◽  
Interesting Property ◽  
Biological Data ◽  
Phylogenetic Networks ◽  
Linear Delay ◽  
Algorithmic Problems

Abstract 'Tree-based' phylogenetic networks provide a mathematically-tractable model for representing reticulate evolution in biology. Such networks consist of an underlying 'support tree' together with arcs between the edges of this tree. However, a tree-based network can have several such support trees, and this leads to a variety of algorithmic problems that are relevant to the analysis of biological data. Recently, Hayamizu (arXiv:1811.05849 [math.CO]) proved a structure theorem for tree-based phylogenetic networks and obtained linear-time and linear-delay algorithms for many basic problems on support trees, such as counting, optimisation, and enumeration. In the present paper, we consider the following fundamental problem in statistical data analysis: given a tree-based phylogenetic network $N$ whose arcs are associated with probability, create the top-$k$ support tree ranking for $N$ by their likelihood values. We provide a linear-delay (and hence optimal) algorithm for the problem and thus reveal the interesting property of tree-based phylogenetic networks that ranking top-$k$ support trees is as computationally easy as picking $k$ arbitrary support trees.

Assessing the fit of the multi-species network coalescent to multi-locus data

2020 ◽  
Author(s):  
Ruoyi Cai ◽  
Cécile Ané
Keyword(s):  
Model Selection ◽  
Goodness Of Fit ◽  
Network Inference ◽  
Phylogenetic Network ◽  
Phylogenetic Networks ◽  
Supplementary Information ◽  
Goodness Of Fit Test ◽  
Full Likelihood ◽  
Genome Wide ◽  
Inference Methods

Abstract Motivation With growing genome-wide molecular datasets from next-generation sequencing, phylogenetic networks can be estimated using a variety of approaches. These phylogenetic networks include events like hybridization, gene flow or horizontal gene transfer explicitly. However, the most accurate network inference methods are computationally heavy. Methods that scale to larger datasets do not calculate a full likelihood, such that traditional likelihood-based tools for model selection are not applicable to decide how many past hybridization events best fit the data. We propose here a goodness-of-fit test to quantify the fit between data observed from genome-wide multi-locus data, and patterns expected under the multi-species coalescent model on a candidate phylogenetic network. Results We identified weaknesses in the previously proposed TICR test, and proposed corrections. The performance of our new test was validated by simulations on real-world phylogenetic networks. Our test provides one of the first rigorous tools for model selection, to select the adequate network complexity for the data at hand. The test can also work for identifying poorly inferred areas on a network. Availability and implementation Software for the goodness-of-fit test is available as a Julia package at https://github.com/cecileane/QuartetNetworkGoodnessFit.jl. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals THE NET-HMM APPROACH: PHYLOGENETIC NETWORK INFERENCE BY COMBINING MAXIMUM LIKELIHOOD AND HIDDEN MARKOV MODELS

2009 ◽  
Vol 07 (04) ◽  
pp. 625-644 ◽  
Author(s):  
SAGI SNIR ◽  
TAMIR TULLER
Keyword(s):  
Network Inference ◽  
Markov Models ◽  
Hidden Markov ◽  
Bacterial Genome ◽  
Genetic Material ◽  
Phylogenetic Network ◽  
Significance Test ◽  
Amino Acid Sequences ◽  
Phylogenetic Networks ◽  
Significant Mechanism

Horizontal gene transfer (HGT) is the event of transferring genetic material from one lineage in the evolutionary tree to a different lineage. HGT plays a major role in bacterial genome diversification and is a significant mechanism by which bacteria develop resistance to antibiotics. Although the prevailing assumption is of complete HGT, cases of partial HGT (which are also named chimeric HGT) where only part of a gene is horizontally transferred, have also been reported, albeit less frequently. In this work we suggest a new probabilistic model, the NET-HMM, for analyzing and modeling phylogenetic networks. This new model captures the biologically realistic assumption that neighboring sites of DNA or amino acid sequences are not independent, which increases the accuracy of the inference. The model describes the phylogenetic network as a Hidden Markov Model (HMM), where each hidden state is related to one of the network's trees. One of the advantages of the NET-HMM is its ability to infer partial HGT as well as complete HGT. We describe the properties of the NET-HMM, devise efficient algorithms for solving a set of problems related to it, and implement them in software. We also provide a novel complementary significance test for evaluating the fitness of a model (NET-HMM) to a given dataset. Using NET-HMM, we are able to answer interesting biological questions, such as inferring the length of partial HGT's and the affected nucleotides in the genomic sequences, as well as inferring the exact location of HGT events along the tree branches. These advantages are demonstrated through the analysis of synthetical inputs and three different biological inputs.

scholarly journals Practical Aspects of Phylogenetic Network Analysis Using PhyloNet

2019 ◽  
Author(s):  
Zhen Cao ◽  
Xinhao Liu ◽  
Huw A. Ogilvie ◽  
Zhi Yan ◽  
Luay Nakhleh
Keyword(s):  
Incomplete Lineage Sorting ◽  
Phylogenetic Network ◽  
Synthetic Data ◽  
Simulated Data ◽  
Single Species ◽  
Phylogenetic Networks ◽  
Lineage Sorting ◽  
Data Set ◽  
Types Of Information ◽  
Analyze Data

AbstractPhylogenetic networks extend trees to enable simultaneous modeling of both vertical and horizontal evolutionary processes. PhyloNet is a software package that has been under constant development for over 10 years and includes a wide array of functionalities for inferring and analyzing phylogenetic networks. These functionalities differ in terms of the input data they require, the criteria and models they employ, and the types of information they allow to infer about the networks beyond their topologies. Furthermore, PhyloNet includes functionalities for simulating synthetic data on phylogenetic networks, quantifying the topological differences between phylogenetic networks, and evaluating evolutionary hypotheses given in the form of phylogenetic networks.In this paper, we use a simulated data set to illustrate the use of several of PhyloNet’s functionalities and make recommendations on how to analyze data sets and interpret the results when using these functionalities. All inference methods that we illustrate are incomplete lineage sorting (ILS) aware; that is, they account for the potential of ILS in the data while inferring the phylogenetic network. While the models do not include gene duplication and loss, we discuss how the methods can be used to analyze data in the presence of polyploidy.The concept of species is irrelevant for the computational analyses enabled by PhyloNet in that species-individuals mappings are user-defined. Consequently, none of the functionalities in PhyloNet deals with the task of species delimitation. In this sense, the data being analyzed could come from different individuals within a single species, in which case population structure along with potential gene flow is inferred (assuming the data has sufficient signal), or from different individuals sampled from different species, in which case the species phylogeny is being inferred.

Sign in / Sign up

Export Citation Format

Share Document