Efficient Reconstruction of Arboreal Networks
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915973698682880 |
|---|---|
| author | Huber, Katharina T. John, Katherine St. |
| author_facet | Huber, Katharina T. John, Katherine St. |
| contents | Arboreal networks are multi-rooted phylogenetic networks whose underlying graph is a tree. We give an encoding of stack-free arboreal networks in terms of triplets and the novel concept of a duet. This yields a polynomial time algorithm to construct these networks from complete triplet and duet systems. The classification results show correctness and lead to a natural metric on these multi-rooted networks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_01044 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Efficient Reconstruction of Arboreal Networks Huber, Katharina T. John, Katherine St. Discrete Mathematics Arboreal networks are multi-rooted phylogenetic networks whose underlying graph is a tree. We give an encoding of stack-free arboreal networks in terms of triplets and the novel concept of a duet. This yields a polynomial time algorithm to construct these networks from complete triplet and duet systems. The classification results show correctness and lead to a natural metric on these multi-rooted networks. |
| title | Efficient Reconstruction of Arboreal Networks |
| topic | Discrete Mathematics |
| url | https://arxiv.org/abs/2605.01044 |