Efficient Reconstruction of Arboreal Networks
For phylogenetic network reconstruction, this work offers a novel method for a specific class of multi-rooted networks, though the problem is niche and the approach is incremental.
The paper provides an encoding of stack-free arboreal networks using triplets and duets, enabling polynomial-time reconstruction from complete triplet and duet systems, with correctness proven and a natural metric introduced.
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.