Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets

Katharina Huber (1) , Leo van Iersel (2) , Vincent Moulton (1) , Celine Scornavacca (3, 4) , Taoyang Wu (1)

1 Department of Computer Science
2 DIAM - Delft Institute of Applied Mathematics
3 UMR ISEM - Institut des Sciences de l'Evolution de Montpellier
4 IBC - Institut de Biologie Computationnelle

Binets and trinets are phylogenetic networks with two and three leaves, respectively. Here we consider the problem of deciding if there exists a binary level-1 phylogenetic network displaying a given set T of binary binets or trinets over a taxon set X , and constructing such a network whenever it exists. We show that this is NP-hard for trinets but polynomial-time solvable for binets. Moreover, we show that the problem is still polynomial-time solvable for inputs consisting of binets and trinets as long as the cycles in the trinets have size three. Finally, we present an O(3 |X | poly(|X |)) time algorithm for general sets of binets and trinets. The latter two algorithms generalise to instances containing level-1 networks with arbitrarily many leaves, and thus provide some of the first supernetwork algorithms for computing networks from a set of rooted phylogenetic networks. B Leo van Iersel

Domaines: Informatique [cs]; Bio-informatique [q-bio.QM]

Katharina Huber, Leo van Iersel, Vincent Moulton, Celine Scornavacca, Taoyang Wu. Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets. Algorithmica, 2017, 77 (1), pp.173-200. ⟨10.1007/s00453-015-0069-8⟩. ⟨hal-02154892⟩