Scanning Phylogenetic Networks is NP-hard - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Scanning Phylogenetic Networks is NP-hard


Phylogenetic networks are rooted directed acyclic graphs used to depict the evolution of a set of species in the presence of reticulate events. Reconstructing these networks from molecular data is challenging and current algorithms fail to scale up to genome-wide data. In this paper, we introduce a new width measure intended to help design faster parameterized algorithms for this task. We study its relation with other width measures and problems in graph theory and finally prove that deciding it is NP-complete, even for very restricted classes of networks.
Fichier principal
Vignette du fichier
hrl.pdf (569.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02353161 , version 1 (07-11-2019)
hal-02353161 , version 2 (12-10-2022)



Vincent Berry, Celine Scornavacca, Mathias Weller. Scanning Phylogenetic Networks is NP-hard. SOFSEM 2020 - 46th International Conference on Current Trends in Theory and Practice of Informatics, Jan 2020, Limassol, Cyprus. pp.519-530, ⟨10.1007/978-3-030-38919-2_42⟩. ⟨hal-02353161v2⟩
207 View
381 Download



Gmail Facebook Twitter LinkedIn More