Efficient Reconstruction of Arboreal Networks

TL;DR

This paper introduces a polynomial-time method for reconstructing arboreal networks from triplet and duet data, providing a new encoding and classification framework.

Contribution

It presents a novel encoding of stack-free arboreal networks using triplets and duets, along with an efficient reconstruction algorithm.

Findings

Polynomial-time algorithm for network reconstruction

New encoding scheme using triplets and duets

Classification results establish correctness and metrics

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.