Metraipolis › archive › dc_aa2cf99c7b6f
An extension of the classic Buneman theorem from phylogenetic trees to networks — arXiv:2610.41725
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41725
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T05:45:20.219Z
- SHA-256 of the archived text
4530a9705288d8bc9709822c855ee91c8551b9baa28be48a27eb2717a5e9b087- Stable URL of this page
https://metraipolis.com/documento/dc_aa2cf99c7b6f
How to cite
An extension of the classic Buneman theorem from phylogenetic trees to networks — arXiv:2610.41725 — arXiv (en), https://arxiv.org/abs/2610.41725 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aa2cf99c7b6f (Metraipolis archive dc_aa2cf99c7b6f, sha256 4530a9705288d8bc9709822c855ee91c8551b9baa28be48a27eb2717a5e9b087)
BibTeX
@misc{dcaa2cf99c7b6f,
title = {An extension of the classic Buneman theorem from phylogenetic trees to networks — arXiv:2610.41725},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41725},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aa2cf99c7b6f; sha256 4530a9705288d8bc9709822c855ee91c8551b9baa28be48a27eb2717a5e9b087},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41725. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Phylogenetic networks provide a natural framework for representing reticulate evolutionary events such as horizontal gene transfer and hybridization. In the present manuscript, we investigate the identifiability of phylogenetic networks under (hardwired) parsimony, a natural extension of Maximum Parsimony from trees to networks. More precisely, we ask which structural features of a network can be uniquely inferred from so-called $A_k$-alignments under this criterion. While identifiability has been studied extensively for phylogenetic trees under parsimony, little is known about the identifiability of networks under hardwired parsimony. We take a first step towards addressing this gap by developing a general framework for studying identifiability under hardwired parsimony. We then use this framework to show that the tree of blobs of a phylogenetic network can be reconstructed from its $A_1$-alignment. This result can be viewed as a natural extension of Buneman's well-known splits equivalence theorem. Finally, we show that, under hardwired parsimony, cycles of length at least $5$ cannot in general be uniquely identified from character data, establishing a fundamental limitation of hardwired parsimony. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Populations and Evolution (q-bio.PE) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2610.41725 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T05:32:17.021Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).