Identifiability of local and global features of phylogenetic networks from average distances
From MaRDI portal
Publication:2103383
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.
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
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
- Constructing tree-child networks from distance matrices
- Determining phylogenetic networks from inter-taxa distances
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
- Distinguishing phylogenetic networks
- Graph theory
- Identifiability of species network topologies from genomic sequences using the logDet distance
- Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution
- Identifying species network features from gene tree quartets under the coalescent model
- Mathematical Foundations of Computer Science 2005
- Phylogeny. Discrete and random processes in evolution
- Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
- Reconstruction of certain phylogenetic networks from their tree-average distances
- Recovering normal networks from shortest inter-taxa distance information
- Tree-like reticulation networks -- when do tree-like distances also support reticulate evolution?
- Unrooted non-binary tree-based phylogenetic networks
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
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)
