Identifiability of local and global features of phylogenetic networks from average distances
From MaRDI portal
Publication:2103383
DOI10.1007/S00285-022-01847-8zbMATH Open1505.92143arXiv2110.11814OpenAlexW4311574484MaRDI QIDQ2103383FDOQ2103383
Authors: Jingcheng Xu, Cécile Ané 
Publication date: 13 December 2022
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Abstract: Phylogenetic networks extend phylogenetic trees to model non-vertical inheritance, by which a lineage inherits material from multiple parents. The computational complexity of estimating phylogenetic networks from genome-wide data with likelihood-based methods limits the size of networks that can be handled. Methods based on pairwise distances could offer faster alternatives. We study here the information that average pairwise distances contain on the underlying phylogenetic network, by characterizing local and global features that can or cannot be identified. For general networks, we clarify that the root and edge lengths adjacent to reticulations are not identifiable, and then focus on the class of zipped-up semidirected networks. We provide a criterion to swap subgraphs locally, such as 3-cycles, resulting in indistinguishable networks. We propose the "distance split tree", which can be constructed from pairwise distances, and prove that it is a refinement of the network's tree of blobs, capturing the tree-like features of the network. For level-1 networks, this distance split tree is equal to the tree of blobs refined to separate polytomies from blobs, and we prove that the mixed representation of the network is identifiable. The information loss is localized around 4-cycles, for which the placement of the reticulation is unidentifiable. The mixed representation combines split edges for 4-cycles, regular tree and hybrid edges from the semidirected network, and edge parameters that encode all information identifiable from average pairwise distances.
Full work available at URL: https://arxiv.org/abs/2110.11814
Recommendations
- Reconstruction of certain phylogenetic networks from their tree-average distances
- Determining phylogenetic networks from inter-taxa distances
- Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
- Unique solvability of certain hybrid networks from their distances
Cites Work
- Phylogeny. Discrete and random processes in evolution
- Title not available (Why is that?)
- Graph theory
- Determining phylogenetic networks from inter-taxa distances
- Reconstruction of certain phylogenetic networks from their tree-average distances
- An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
- Mathematical Foundations of Computer Science 2005
- Distinguishing phylogenetic networks
- Recovering normal networks from shortest inter-taxa distance information
- Constructing tree-child networks from distance matrices
- Unrooted non-binary tree-based phylogenetic networks
- Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution
- Tree-like reticulation networks -- when do tree-like distances also support reticulate evolution?
- Identifying species network features from gene tree quartets under the coalescent model
- Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
- Identifiability of species network topologies from genomic sequences using the logDet distance
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
Cited In (6)
- Identifiability of species network topologies from genomic sequences using the logDet distance
- The tree of blobs of a species network: identifiability under the coalescent
- Exploring spaces of semi-directed level-1 networks
- Anomalous networks under the multispecies coalescent: theory and prevalence
- Identifying circular orders for blobs in phylogenetic networks
- Distinguishing phylogenetic networks
Uses Software
This page was built for publication: Identifiability of local and global features of phylogenetic networks from average distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103383)
