Solving the tree containment problem in linear time for nearly stable phylogenetic networks

Abstract : A phylogenetic network is a rooted acyclic digraph whose leaves are uniquely labeled with a set of taxa. The tree containment problem asks whether or not a phylogenetic network displays a phylogenetic tree over the same set of labeled leaves. It is a fundamental problem arising from validation of phylogenetic network models. The tree containment problem is NP-complete in general. To identify network classes on which the problem is polynomial time solvable, we introduce two classes of networks by generalizations of tree-child networks through vertex stability, namely nearly stable networks and genetically stable networks. Here, we study the combinatorial properties of these two classes of phylogenetic networks. We also develop a linear-time algorithm for solving the tree containment problem on binary nearly stable networks.
Document type :
Journal articles
Discrete Applied Mathematics, Elsevier, 2017, to appear, 〈10.1016/j.dam.2017.07.015〉
Liste complète des métadonnées

https://hal-upec-upem.archives-ouvertes.fr/hal-01575001
Contributor : Philippe Gambette <>
Submitted on : Thursday, August 17, 2017 - 11:48:25 AM
Last modification on : Friday, August 18, 2017 - 1:00:09 AM

Identifiers

Collections

Citation

Philippe Gambette, Andreas D.M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discrete Applied Mathematics, Elsevier, 2017, to appear, 〈10.1016/j.dam.2017.07.015〉. 〈hal-01575001〉

Share

Metrics

Record views

76