Distinguishing phylogenetic networks
From MaRDI portal
Publication:4564014
Abstract: Phylogenetic networks are becoming increasingly popular in phylogenetics since they have the ability to describe a wider range of evolutionary events than their tree counterparts. In this paper, we study Markov models on phylogenetic networks and their associated geometry. We restrict our attention to large-cycle networks, networks with a single undirected cycle of length at least four. Using tools from computational algebraic geometry, we show that the semi-directed network topology is generically identifiable for Jukes-Cantor large-cycle network models.
Recommendations
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
- Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution
- Identifiability of local and global features of phylogenetic networks from average distances
- Identifiability of large phylogenetic mixture models
- Identifiability in phylogenetics using algebraic matroids
Cites work
- A Fourier inversion formula for evolutionary trees
- Computing the maximum agreement of phylogenetic networks
- Identifiability of 3-class Jukes-Cantor mixtures
- Identifiability of large phylogenetic mixture models
- Identifiability of the unrooted species tree topology under the coalescent model with time-reversible substitution processes, site-specific rate variation, and invariable sites
- Invariants of some probability models used in phylogenetic inference
- New characterisations of tree-based networks and proximity measures
- Phylogenetic networks with every embedded phylogenetic tree a base tree
- Toric Ideals of Phylogenetic Invariants
- Toric fiber products
- Trinets encode tree-child and level-2 phylogenetic networks
Cited in
(22)- The model-specific Markov embedding problem for symmetric group-based models
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman model
- Phylogenetic network dissimilarity measures that take branch lengths into account
- Computing algebraic degrees of phylogenetic varieties
- Identifiability of homoscedastic linear structural equation models using algebraic matroids
- When is a phylogenetic network simply an amalgamation of two trees?
- Identifying circular orders for blobs in phylogenetic networks
- Rank conditions on phylogenetic networks
- The fine structure of galls in phylogenetic networks
- Bounding the softwired parsimony score of a phylogenetic network
- Dimensions of level-1 group-based phylogenetic networks
- Phylogenetic networks that display a tree twice
- Exploring spaces of semi-directed level-1 networks
- Phylogenetic Networks
- Identifiability of local and global features of phylogenetic networks from average distances
- Identifying species network features from gene tree quartets under the coalescent model
- Boolean operators and neural networks
- Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
- Identifiability of species network topologies from genomic sequences using the logDet distance
- Identifiability in phylogenetics using algebraic matroids
This page was built for publication: Distinguishing phylogenetic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564014)
