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.
We thank Fabio Pardi to have brought the problem to our attention and the Genome Harvest project, ref. ID 1504-006 (“Investissements d’avenir”, ANR-10-LABX-0001-01).
- 13.Rabier, C.E., Berry, V., Pardi, F., Scornavacca, C.: On the inference of complicated phylogenetic networks by Markov chain Monte-Carlo (submitted)Google Scholar