Identifiability in phylogenetics using algebraic matroids
From MaRDI portal
Publication:2229705
Abstract: Identifiability is a crucial property for a statistical model since distributions in the model uniquely determine the parameters that produce them. In phylogenetics, the identifiability of the tree parameter is of particular interest since it means that phylogenetic models can be used to infer evolutionary histories from data. In this paper we introduce a new computational strategy for proving the identifiability of discrete parameters in algebraic statistical models that uses algebraic matroids naturally associated to the models. We then use this algorithm to prove that the tree parameters are generically identifiable for 2-tree CFN and K3P mixtures. We also show that the -cycle phylogenetic network parameter is identifiable under the K2P and K3P models.
Recommendations
- Identifiability of large phylogenetic mixture models
- Identifiability of 3-class Jukes-Cantor mixtures
- Estimating trees from filtered data: identifiability of models for morphological phylogenetics
- Identifiability of a Markovian model of molecular evolution with gamma-distributed rates
- scientific article; zbMATH DE number 5247137
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- Algebraic statistics
- Dimensions of group-based phylogenetic mixtures
- Distinguishing phylogenetic networks
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Identifiability of 3-class Jukes-Cantor mixtures
- Invariants of phylogenies in a simple case with discrete states
- Invariants of some probability models used in phylogenetic inference
- Mixed-up trees: the structure of phylogenetic mixtures
- Phylogeny. Discrete and random processes in evolution
- Toric Ideals of Phylogenetic Invariants
Cited in
(14)- Distinguishing phylogenetic networks
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman model
- Identifiability of homoscedastic linear structural equation models using algebraic matroids
- Bounding the softwired parsimony score of a phylogenetic network
- Nonlinear algebra and applications
- Exploring spaces of semi-directed level-1 networks
- Identifiability and inference of phylogenetic birth-death models
- Estimating trees from filtered data: identifiability of models for morphological phylogenetics
- Identifiability of a coalescent-based population tree model
- Identifiability of large phylogenetic mixture models
- 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 of 3-class Jukes-Cantor mixtures
This page was built for publication: Identifiability in phylogenetics using algebraic matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229705)
