Name
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 k-cycle phylogenetic network parameter is identifiable under the K2P and K3P models. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.jsc.2020.04.012 | Journal of Symbolic Computation |
Keywords | DocType | Volume |
Identifiability,Algebraic matroids,Phylogenetics,Group-based models,Mixture models | Journal | 104 |
ISSN | Citations | PageRank |
0747-7171 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin Hollering | 1 | 0 | 0.34 |
| Seth Sullivant | 2 | 93 | 19.17 |