Scanning Phylogenetic Networks is NP-hard

Abstract : 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.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-02353161
Contributor : Celine Scornavacca <>
Submitted on : Thursday, November 7, 2019 - 11:07:31 AM
Last modification on : Wednesday, November 13, 2019 - 10:21:07 AM

File

hrl.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02353161, version 1

Citation

Vincent Berry, Celine Scornavacca, Mathias Weller. Scanning Phylogenetic Networks is NP-hard. SOFSEM 2020, Jan 2020, Cyprus, Cyprus. ⟨hal-02353161⟩

Share

Metrics

Record views

16

Files downloads

42