Quantifying genetic innovation: mathematical foundations for the topological study of reticulate evolution

DOI10.1137/18M118150XzbMATH Open1433.92030arXiv1804.01398OpenAlexW3010039449WikidataQ114615473 ScholiaQ114615473MaRDI QIDQ4959843FDOQ4959843

Authors: Michael Lesnick, R. Rabadán, Daniel I. Scholes Rosenbloom 

Publication date: 7 April 2020

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Abstract: A topological approach to the study of genetic recombination, based on persistent homology, was introduced by Chan, Carlsson, and Rabad'an in 2013. This associates a sequence of signatures called barcodes to genomic data sampled from an evolutionary history. In this paper, we develop theoretical foundations for this approach. First, we present a novel formulation of the underlying inference problem. Specifically, we introduce and study the novelty profile, a simple, stable statistic of an evolutionary history which not only counts recombination events but also quantifies how recombination creates genetic diversity. We propose that the (hitherto implicit) goal of the topological approach to recombination is the estimation of novelty profiles. We then study the problem of obtaining a lower bound on the novelty profile using barcodes. We focus on a low-recombination regime, where the evolutionary history can be described by a directed acyclic graph called a galled tree, which differs from a tree only by isolated topological defects. We show that in this regime, under a complete sampling assumption, the $1^{m}athrmst$ barcode yields a lower bound on the novelty profile, and hence on the number of recombination events. For $i>1$, the $i^{mathrmth}$ barcode is empty. In addition, we use a stability principle to strengthen these results to ones which hold for any subsample of an arbitrary evolutionary history. To establish these results, we describe the topology of the Vietoris--Rips filtrations arising from evolutionary histories indexed by galled trees. As a step towards a probabilistic theory, we also show that for a random history indexed by a fixed galled tree and satisfying biologically reasonable conditions, the intervals of the $1^{mathrmst}$ barcode are independent random variables. Using simulations, we explore the sensitivity of these intervals to recombination.

Full work available at URL: https://arxiv.org/abs/1804.01398

Recommendations

• On the minimum number of recombination events in the evolutionary history of DNA se\-quences
• On the minimum number of topologies explaining a sample of DNA sequences
• The arithmetic topology of genetic alignments
• Distribution of distances between topologies and its effect on detection of phylogenetic recombination
• Topology of viral evolution

zbMATH Keywords

persistent homologytopological data analysisrecombinationreticulate evolution

Mathematics Subject Classification ID

Problems related to evolution (92D15) Persistent homology and applications, topological data analysis (55N31)

Cites Work

• The structure and stability of persistence modules
• Topology and data
• Computational topology. An introduction
• Title not available (Why is that?)
• Random geometric complexes
• Stability of persistence diagrams
• Title not available (Why is that?)
• Title not available (Why is that?)
• Coalescent theory. An introduction
• Probability. Theory and examples.
• Title not available (Why is that?)
• Decomposition of pointwise finite-dimensional persistence modules.
• Persistence stability for geometric complexes
• Proximity of persistence modules and their diagrams
• Combinatorial algebraic topology
• Topology of viral evolution
• Topological pattern recognition for point cloud data
• ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks. With contributions from Charles H. Langley, Yun S. Song and Yufeng Wu
• The Vietoris-Rips complexes of a circle
• A user's guide to discrete Morse theory
• Induced matchings and the algebraic stability of persistence barcodes
• A complete characterization of the one-dimensional intrinsic Čech persistence diagrams for metric graphs
• Persistence theory. From quiver representations to data analysis
• On Vietoris-Rips complexes of ellipses
• Topological Data Analysis for Genomics and Evolution
• A comparison framework for interleaved persistence modules
• Topological signatures for population admixture

Cited In (11)

• Vietoris-Rips and Čech complexes of metric gluings
• A primer on persistent homology of finite metric spaces
• On a coupled map lattice formulation of the evolution of genetic sequences
• On homotopy types of Vietoris-Rips complexes of metric gluings
• The arithmetic topology of genetic alignments
• On Vietoris-Rips complexes of hypercube graphs
• Operations on Metric Thickenings
• Topological signatures for population admixture
• New families of stable simplicial filtration functors
• The evolution of genetic topologies
• On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs

This page was built for publication: Quantifying genetic innovation: mathematical foundations for the topological study of reticulate evolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959843)