HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time

Abstract : A phylogenetic network is a rooted acyclic digraph whose leaves are labeled with a set of taxa. The tree containment problem is a fundamental problem arising from model validation in the study of phylogenetic networks. It asks to determine whether or not a given network displays a given phylogenetic tree over the same leaf set. It is known to be NP-complete in general. Whether or not it remains NP-complete for stable networks is an open problem. We make progress towards answering that question by presenting a quadratic time algorithm to solve the tree containment problem for a new class of networks that we call genetically stable networks, which include tree-child networks and comprise a subclass of stable networks.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

Contributor : Philippe Gambette Connect in order to contact the contributor
Submitted on : Saturday, November 7, 2015 - 11:14:02 PM
Last modification on : Saturday, January 15, 2022 - 3:56:56 AM
Long-term archiving on: : Monday, February 8, 2016 - 11:14:30 AM


IWOCA2015_genetically_stable (...
Files produced by the author(s)



Philippe Gambette, Andreas D.M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. IWOCA 2015, Oct 2015, Verona, Italy. pp.197-208, ⟨10.1007/978-3-319-29516-9_17⟩. ⟨hal-01226035⟩



Record views


Files downloads