Efficient Reconstruction of Arboreal Networks

Huber, Katharina T. ORCID: https://orcid.org/0000-0002-6368-7511 and St. John, Katherine (2026) Efficient Reconstruction of Arboreal Networks. Information Processing Letters, 195. ISSN 0020-0190

[thumbnail of revised-final]
Preview
PDF (revised-final) - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (582kB) | Preview
[thumbnail of 1-s2.0-S0020019026000451-main]
Preview
PDF (1-s2.0-S0020019026000451-main) - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (2MB) | Preview

Abstract

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.

Item Type: Article
Faculty \ School: Faculty of Science > School of Computing Sciences
UEA Research Groups: Faculty of Science > Research Groups > Computational Biology
Depositing User: LivePure Connector
Date Deposited: 17 Aug 2026 11:09
Last Modified: 13 Sep 2026 08:51
URI: https://ueaeprints.uea.ac.uk/id/eprint/104172
DOI:

Downloads

Downloads per month over past year

Actions (login required)

View Item View Item