Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

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.
Fichier principal
Vignette du fichier
IWOCA2015_genetically_stable (1).pdf (262.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01226035 , version 1 (07-11-2015)

Identifiers

Cite

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⟩
289 View
242 Download

Altmetric

Share

Gmail Facebook X LinkedIn More