Abstract
Phylogenetic networks model evolutionary phenomena that trees fail to capture such as horizontal gene transfer and hybridization. The same Markov models used for sequence evolution on trees can also be extended to networks and similar problems, such as determining if the network parameter is identifiable or finding the invariants of the model, can be studied. This paper focuses on finding the invariants of the Cavendar-Farris-Neyman (CFN) model on level-1 phylogenetic networks by reducing the problem to finding invariants of sunlet networks, which are level-1 networks consisting of a single cycle with leaves at each vertex. We determine all quadratic invariants for sunlet networks, and conjecture these generate the full sunlet ideal.
| Original language | English |
|---|---|
| Article number | 102633 |
| Journal | Advances in Applied Mathematics |
| Volume | 153 |
| DOIs | |
| State | Published - Feb 2024 |
Bibliographical note
Publisher Copyright:© 2023 Elsevier Inc.
Funding
Joseph Cummings was partially supported by Simons Collaboration Grant (587209) and the US National Science Foundation (DMS 2101911).Benjamin Hollering was partially supported by the US National Science Foundation (DMS 1615660).Christopher Manon was partially supported by Simons Collaboration Grant (587209) and the US National Science Foundation (DMS 2101911).
| Funders | Funder number |
|---|---|
| Simons Collaboration | 587209 |
| National Science Foundation Arctic Social Science Program | DMS 1615660, DMS 2101911 |
Keywords
- Algebraic variety
- Group-based model
- Markov model
- Phylogenetic invariant
- Phylogenetic network
- Torus action
ASJC Scopus subject areas
- Applied Mathematics