Year: 2026
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Institution: Universitat de les Illes Balears
Language: English
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: green
Award: G6033112984
OpenAlex ID: W7214072473