Metraipolis › archive › dc_64d43304fed4

Characterization of tree-child networks in terms of mu vectors — arXiv:2609.25177

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25177
License (as archived)
CC0-1.0
Archived
2026-10-08T15:55:47.668Z
SHA-256 of the archived text
c91ee36bcc620e91a64700435b221120617e459910efbbb178021ef1e02bdc05
Stable URL of this page
https://metraipolis.com/documento/dc_64d43304fed4

How to cite

Characterization of tree-child networks in terms of mu vectors — arXiv:2609.25177 — arXiv (en), https://arxiv.org/abs/2609.25177 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_64d43304fed4 (Metraipolis archive dc_64d43304fed4, sha256 c91ee36bcc620e91a64700435b221120617e459910efbbb178021ef1e02bdc05)
BibTeX
@misc{dc64d43304fed4,
  title = {Characterization of tree-child networks in terms of mu vectors — arXiv:2609.25177},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25177},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_64d43304fed4; sha256 c91ee36bcc620e91a64700435b221120617e459910efbbb178021ef1e02bdc05},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25177. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We characterize tree-child phylogenetic networks in terms of their mu-representations. First, we give a structural characterization of tree-child networks by means of ordered tree-path decompositions. We then translate this decomposition into a set of purely vectorial conditions on finite subsets M in N^n. We prove that such a set M is the mu-representation of a tree-child phylogenetic network if and only if it is tree-child mu-compatible. This provides a feasibility criterion for tree-child mu-representations which can be used as a basis for reconstruction and further algorithmic applications. Note that this paper presents results arising from ongoing research on tree-child networks and that the results will be further developed and placed into proper context in subsequent versions.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Populations and Evolution (q-bio.PE).
Pagina del lavoro: https://arxiv.org/abs/2609.25177 — 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-10-08T15:16:21.664Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).