Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
From MaRDI portal
Publication:2232137
Abstract: Phylogenetic networks can represent evolutionary events that cannot be described by phylogenetic trees. These networks are able to incorporate reticulate evolutionary events such as hybridization, introgression, and lateral gene transfer. Recently, network-based Markov models of DNA sequence evolution have been introduced along with model-based methods for reconstructing phylogenetic networks. For these methods to be consistent, the network parameter needs to be identifiable from data generated under the model. Here, we show that the semi-directed network parameter of a triangle-free, level-1 network model with any fixed number of reticulation vertices is generically identifiable under the Jukes-Cantor, Kimura 2-parameter, or Kimura 3-parameter constraints.
Recommendations
- Distinguishing phylogenetic networks
- Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- A class of phylogenetic networks reconstructable from ancestral profiles
- Phylogenetic networks
Cites work
- A framework for representing reticulate evolution
- Algebraic statistics
- All that glisters is not galled
- Catalog of Small Trees
- Computing and Combinatorics
- Distinguishing phylogenetic networks
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- Identifiability and reconstructibility of species phylogenies under a modified coalescent
- Identifiability in phylogenetics using algebraic matroids
- Identifiability of large phylogenetic mixture models
- 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
- Invariants of some probability models used in phylogenetic inference
- Leaf-reconstructibility of phylogenetic networks
- On encodings of phylogenetic networks of bounded level
- Phylogeny. Discrete and random processes in evolution
- ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks. With contributions from Charles H. Langley, Yun S. Song and Yufeng Wu
- Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model
- Toric Ideals of Phylogenetic Invariants
- Trinets encode tree-child and level-2 phylogenetic networks
Cited in
(23)- 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 species network topologies from genomic sequences using the logDet distance
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- The algebra of the general Markov model on phylogenetic trees and networks
- A Bayesian approach to modelling reticulation events with application to the ribosomal protein gene rps11 of flowering plants
- Distinguishing phylogenetic networks
- Exploring spaces of semi-directed level-1 networks
- Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman model
- Dimensions of level-1 group-based phylogenetic networks
- Identifiability of level-1 species networks from gene tree quartets
- Rank conditions on phylogenetic networks
- Identifying circular orders for blobs in phylogenetic networks
- Identifiability of homoscedastic linear structural equation models using algebraic matroids
- The Pfaffian structure of CFN 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
- ``Normal phylogenetic networks may be emerging as the leading class
- When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
- Group-based phylogenetic models on 3-sunlet networks
- Reconstructing semi-directed level-1 networks using few quarnets
- Computational algebraic geometry for evolutionary biology
- Phylogenetic network models as graphical models
This page was built for publication: Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232137)
