scholarly journals Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes

2021 ◽  
Vol 83 (3) ◽  
Author(s):  
Elizabeth Gross ◽  
Leo van Iersel ◽  
Remie Janssen ◽  
Mark Jones ◽  
Colby Long ◽  
...  

AbstractPhylogenetic networks can represent evolutionary events that cannot be described by phylogenetic trees. These networks are able to incorporate reticulate evolutionary events such as hybridization, introgression, and lateral gene transfer. Recently, network-based Markov models of DNA sequence evolution have been introduced along with model-based methods for reconstructing phylogenetic networks. For these methods to be consistent, the network parameter needs to be identifiable from data generated under the model. Here, we show that the semi-directed network parameter of a triangle-free, level-1 network model with any fixed number of reticulation vertices is generically identifiable under the Jukes–Cantor, Kimura 2-parameter, or Kimura 3-parameter constraints.

2012 ◽  
Vol 10 (04) ◽  
pp. 1250004 ◽  
Author(s):  
PHILIPPE GAMBETTE ◽  
VINCENT BERRY ◽  
CHRISTOPHE PAUL

Phylogenetic networks were introduced to describe evolution in the presence of exchanges of genetic material between coexisting species or individuals. Split networks in particular were introduced as a special kind of abstract network to visualize conflicts between phylogenetic trees which may correspond to such exchanges. More recently, methods were designed to reconstruct explicit phylogenetic networks (whose vertices can be interpreted as biological events) from triplet data. In this article, we link abstract and explicit networks through their combinatorial properties, by introducing the unrooted analog of level-k networks. In particular, we give an equivalence theorem between circular split systems and unrooted level-1 networks. We also show how to adapt to quartets some existing results on triplets, in order to reconstruct unrooted level-k phylogenetic networks. These results give an interesting perspective on the combinatorics of phylogenetic networks and also raise algorithmic and combinatorial questions.


2009 ◽  
Vol 07 (04) ◽  
pp. 597-623 ◽  
Author(s):  
LEO VAN IERSEL ◽  
STEVEN KELK ◽  
MATTHIAS MNICH

Phylogenetic networks provide a way to describe and visualize evolutionary histories that have undergone so-called reticulate evolutionary events such as recombination, hybridization or horizontal gene transfer. The level k of a network determines how non-treelike the evolution can be, with level-0 networks being trees. We study the problem of constructing level-k phylogenetic networks from triplets, i.e. phylogenetic trees for three leaves (taxa). We give, for each k, a level-k network that is uniquely defined by its triplets. We demonstrate the applicability of this result by using it to prove that (1) for all k ≥ 1 it is NP-hard to construct a level-k network consistent with all input triplets, and (2) for all k ≥ 0 it is NP-hard to construct a level-k network consistent with a maximum number of input triplets, even when the input is dense. As a response to this intractability, we give an exact algorithm for constructing level-1 networks consistent with a maximum number of input triplets.


2021 ◽  
Vol 59 (3) ◽  
pp. 699-718
Author(s):  
R. Sundara Rajan ◽  
A. Arul Shantrinal ◽  
K. Jagadeesh Kumar ◽  
T. M. Rajalaxmi ◽  
Indra Rajasingh ◽  
...  

2020 ◽  
Vol 36 (17) ◽  
pp. 4590-4598
Author(s):  
Robert Page ◽  
Ruriko Yoshida ◽  
Leon Zhang

Abstract Motivation Due to new technology for efficiently generating genome data, machine learning methods are urgently needed to analyze large sets of gene trees over the space of phylogenetic trees. However, the space of phylogenetic trees is not Euclidean, so ordinary machine learning methods cannot be directly applied. In 2019, Yoshida et al. introduced the notion of tropical principal component analysis (PCA), a statistical method for visualization and dimensionality reduction using a tropical polytope with a fixed number of vertices that minimizes the sum of tropical distances between each data point and its tropical projection. However, their work focused on the tropical projective space rather than the space of phylogenetic trees. We focus here on tropical PCA for dimension reduction and visualization over the space of phylogenetic trees. Results Our main results are 2-fold: (i) theoretical interpretations of the tropical principal components over the space of phylogenetic trees, namely, the existence of a tropical cell decomposition into regions of fixed tree topology; and (ii) the development of a stochastic optimization method to estimate tropical PCs over the space of phylogenetic trees using a Markov Chain Monte Carlo approach. This method performs well with simulation studies, and it is applied to three empirical datasets: Apicomplexa and African coelacanth genomes as well as sequences of hemagglutinin for influenza from New York. Availability and implementation Dataset: http://polytopes.net/Data.tar.gz. Code: http://polytopes.net/tropica_MCMC_codes.tar.gz. Supplementary information Supplementary data are available at Bioinformatics online.


2009 ◽  
Vol 07 (04) ◽  
pp. 625-644 ◽  
Author(s):  
SAGI SNIR ◽  
TAMIR TULLER

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.


2021 ◽  
Author(s):  
Xiaolong Li ◽  
Hong Li ◽  
Zhenhua Yang ◽  
Zefeng Zhang

Abstract Background: Exploring the composition and evolution regularity of genome sequences and constructing phylogenetic relationship by alignment-free method in genome level are high-profile topics. Our previous researches discovered the CG and TA independent selection laws existed in genome sequences by analysis on the spectral features of 8-mer subsets of 920 eukaryote and prokaryote genomes. We found that the evolution state of genomes is determined by the intensity of the two independent selections and the degree of the mutual inhibition between them. Results: In this study, the two independent selection patterns of 22 primate and 28 insect genome sequences were analyzed further. The two complete 8-mer motif sets containing CG or TA dinucleotide and their feature of relative frequency are proposed. We found that the two 8-mer sets and their feature are related directly to sequence evolution of genomes. According to the relative frequency of two 8-mer sets, phylogenetic trees were constructed respectively for the given primate and insect genomes. Through analysis and comparison, we found that our phylogenetic trees are more consistent with the known conclusions. Conclusions: The two kinds of phylogenetic relationships constructed by CG 8-mer set and TA 8-mer set are similar in insect genomes, but the phylogenetic relationship constructed by CG 8-mer set reflect the evolution state of genomes in current age and phylogenetic relationship constructed by TA 8-mer set reflect the evolution state of genomes in a slight earlier period. We thought it is the result that the TA independent selection is repressed by the CG independent selection in the process of genome evolution. Our study provides a theoretical approach to construct more objective evolution relationships in genome level.


2019 ◽  
Author(s):  
◽  
Marco Antonio Navarro

Ionic currents drive cellular function within all living cells to perform highly specific tasks. For excitable cells, such as muscle and neurons, voltage-gated ion channels have finely tuned kinetics that allow the transduction of Action potentials to other cells. Voltage-gated ion channels are molecular machines that open and close depending on electrical potential. Neuronal firing rates are largely determined by the overall availability of voltage-gated Na+ and K+ currents.This work describes new approaches for collecting and analyzing experimental data that can be used to streamline experiments. Ion channels are composed of multimeric complexes regulated by intracellular factors producing complex kinetics. The stochastic behavior of thousands of individual ion hannels coordinates to produce cellular activity. To describe their activity and test hypotheses about the channel, experimenters often fit Markov models to a set of experimental data. Markov models are defined by a set of states, whose transitions described by rate constants. To improve the modeling process, we have developed computational approaches to introduce kinetic constraints that reduces the parameter search space. This work describes the implementation and mathematical transformations required to describe linear and non-linear parameter constraints that govern rate constants. Not all ion channel behaviors can easily be described by rate constants. Therefore, we developed and implemented a penalty-based mechanism that can be used to guide the optimization engine to produce a model with a desired behavior, such as single-channel open probability and use dependent effects. To streamline data collection for experiments in brain slice preparations, we developed a 3D virtual software environment that incorporates data from micro-positioning motors and scientific cameras in real-time. This environment provides positional feedback to the investigator and allows for the creation of data maps including both images and electrical recordings. We have also produced semi-automatic targeting procedures that simplifies the overall experimental experience. Experimentally, this work also examines how the kinetic mechanism of voltage gated Na channels regulates the neuronal firing of brainstem respiratory neurons. These raphe neurons are intrinsic pacemakers that do not rely on synaptic connections to elicit activity. I explored how intracellular calcium regulates the kinetics of TTX-sensitive Na+ currents using whole-cell patch clamp electrophysiology. Established with intracellular Ca2+ buffers, high [Ca2+] levels greater than ~7 [micro]M did not change the voltage dependence of steady-state activation and inactivation, but slightly slowed inactivation time course. However, the recovery from inactivation and use dependence inactivation is slowed by high intracellular [Ca2+]. Overall, these approaches described in this work have improved data acquisition and data analysis to create better ion channel models and enhance the electrophysiology experience.


Author(s):  
Ben Bettisworth ◽  
Alexandros Stamatakis

AbstractSummaryIn phylogenetic analysis, it is common to infer unrooted trees. Thus, it is unknown which node is the most recent common ancestor of all the taxa in the phylogeny. However, knowing the root location is desirable for downstream analyses and interpretation. There exist several methods to recover a root, such as midpoint rooting or rooting the tree at an outgroup. Non-reversible Markov models can also be used to compute the likelihood of a potential root position. We present a software called RootDigger which uses a non-reversible Markov model to compute the most likely root location on a given tree and to infer a confidence value for each possible root placement.Availability and implementationRootDigger is available under the MIT licence at https://github.com/computations/root_digger


2017 ◽  
Author(s):  
Timothy G. Vaughan

AbstractSummaryIcyTree is an easy-to-use application which can be used to visualize a wide variety of phylogenetic trees and networks. While numerous phylogenetic tree viewers exist already, IcyTree distinguishes itself by being a purely online tool, having a responsive user interface, supporting phylogenetic networks (ancestral recombination graphs in particular), and efficiently drawing trees that include information such as ancestral locations or trait values. IcyTree also provides intuitive panning and zooming utilities that make exploring large phylogenetic trees of many thousands of taxa feasible.Availability and ImplementationIcyTree is a web application and can be accessed directly at http://tgvaughan.github.com/icytree. Currently-supported web browsers include Mozilla Firefox and Google Chrome. IcyTree is written entirely in client-side JavaScript (no plugin required) and, once loaded, does not require network access to run. IcyTree is free software, and the source code is made available at http://github.com/tgvaughan/icytree under version 3 of the GNU General Public [email protected]


Sign in / Sign up

Export Citation Format

Share Document