Identifiability of species network topologies from genomic sequences using the logDet distance
From MaRDI portal
Publication:2125155
Abstract: Inference of network-like evolutionary relationships between species from genomic data must address the interwoven signals from both gene flow and incomplete lineage sorting. The heavy computational demands of standard approaches to this problem severely limit the size of datasets that may be analyzed, in both the number of species and the number of genetic loci. Here we provide a theoretical pointer to more efficient methods, by showing that logDet distances computed from genomic-scale sequences retain sufficient information to recover network relationships in the level-1 ultrametric case. This result is obtained under the Network Multispecies Coalescent model combined with a mixture of General Time-Reversible sequence evolution models across individual gene trees, but does not depend on partitioning sequences by genes. Thus under standard stochastic models statistically justifiable inference of network relationships from sequences can be accomplished without consideration of individual genes or gene trees.
Recommendations
- Species Tree Inference from Genomic Sequences Using the Log-Det Distance
- The tree of blobs of a species network: identifiability under the coalescent
- Identifying species network features from gene tree quartets under the coalescent model
- Identifiability of local and global features of phylogenetic networks from average distances
- Determining phylogenetic networks from inter-taxa distances
Cites work
- All that glisters is not galled
- Asymptotic Statistics
- Detecting hybrid speciation in the presence of incomplete lineage sorting using gene tree incongruence: a model
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
- Distinguishing phylogenetic networks
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- Hypothesis testing near singularities and boundaries
- Identifiability in phylogenetics using algebraic matroids
- Identifiability of the unrooted species tree topology under the coalescent model with time-reversible substitution processes, site-specific rate variation, and invariable sites
- Identifying species network features from gene tree quartets under the coalescent model
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- Phylogeny. Discrete and random processes in evolution
- Quarnet inference rules for level-1 networks
- Reconstructibility of unrooted level-k phylogenetic networks from distances
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- Recovering a tree from the leaf colourations it generates under a Markov model
- Species Tree Inference from Genomic Sequences Using the Log-Det Distance
Cited in
(10)- Identifiability of local and global features of phylogenetic networks from average distances
- The tree of blobs of a species network: identifiability under the coalescent
- Species Tree Inference from Genomic Sequences Using the Log-Det Distance
- Exploring spaces of semi-directed level-1 networks
- Designing weights for quartet-based methods when data are heterogeneous across lineages
- Identifiability of level-1 species networks from gene tree quartets
- Identifying circular orders for blobs in phylogenetic networks
- Distinguishing phylogenetic level-2 networks with quartets and inter-taxon quartet distances
- Beyond level-1: identifiability of a class of galled tree-child networks
- When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
This page was built for publication: Identifiability of species network topologies from genomic sequences using the logDet distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2125155)
