eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2023-12-13
30:1
30:12
10.4230/LIPIcs.IPEC.2023.30
article
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks
Jones, Mark
1
https://orcid.org/0000-0002-4091-7089
Schestag, Jannik
1
2
https://orcid.org/0000-0001-7767-2970
TU Delft, The Netherlands
Friedrich-Schiller-Universität Jena, Germany
Phylogenetic Diversity (PD) is a measure of the overall biodiversity of a set of present-day species (taxa) within a phylogenetic tree. We consider an extension of PD to phylogenetic networks. Given a phylogenetic network with weighted edges and a subset S of leaves, the all-paths phylogenetic diversity of S is the summed weight of all edges on a path from the root to some leaf in S. The problem of finding a bounded-size set S that maximizes this measure is polynomial-time solvable on trees, but NP-hard on networks. We study the latter from a parameterized perspective.
While this problem is W[2]-hard with respect to the size of S (and W[1]-hard with respect to the size of the complement of S), we show that it is FPT with respect to several other parameters, including the phylogenetic diversity of S, the acceptable loss of phylogenetic diversity, the number of reticulations in the network, and the treewidth of the underlying graph.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol285-ipec2023/LIPIcs.IPEC.2023.30/LIPIcs.IPEC.2023.30.pdf
Phylogenetic Networks
Phylogenetic Diversity
Parameterized Complexity
W-hierarchy
FPT algorithms