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.
CITATION STYLE
Berry, V., Scornavacca, C., & Weller, M. (2020). Scanning Phylogenetic Networks Is NP-hard. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12011 LNCS, pp. 519–530). Springer. https://doi.org/10.1007/978-3-030-38919-2_42
Mendeley helps you to discover research relevant for your work.