Identifiability in phylogenetics using algebraic matroids

DOI10.1016/j.jsc.2020.04.012zbMath1455.92103arXiv1909.13754OpenAlexW3023125334MaRDI QIDQ2229705

Seth Sullivant, Benjamin Hollering

Publication date: 18 February 2021

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.13754

zbMATH Keywords

identifiabilitymixture modelsalgebraic matroidsphylogeneticsgroup-based models

Mathematics Subject Classification ID

Problems related to evolution (92D15) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Related Items

Identifiability of species network topologies from genomic sequences using the logDet distance ⋮ Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Exploring spaces of semi-directed level-1 networks ⋮ Nonlinear algebra and applications ⋮ Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman model ⋮ Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes

Uses Software

• Macaulay2
• Mathematica
• PhylogeneticTrees

Cites Work

• Unnamed Item
• Unnamed Item
• Mixed-up trees: the structure of phylogenetic mixtures
• Invariants of phylogenies in a simple case with discrete states
• Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
• Dimensions of group-based phylogenetic mixtures
• Identifiability of 3-class Jukes-Cantor mixtures
• Invariants of some probability models used in phylogenetic inference
• Phylogeny
• Algebraic Statistics
• Distinguishing Phylogenetic Networks
• Toric Ideals of Phylogenetic Invariants