,
Mark Jones
,
Jannik Schestag
,
Celine Scornavacca
,
Mathias Weller
Creative Commons Attribution 4.0 International license
We investigate parameterized algorithms for computing the average-tree phylogenetic diversity (APD) in rooted phylogenetic networks, studying the problem under different structural parameters that capture the deviation of a network from a tree. Our primary parameter is the scanwidth, a measure of the tree-likeness of a given directed acyclic graph. We show that a subset of taxa with maximum APD can be found in polynomial time in phylogenetic networks with scanwidth at most 2, but becomes NP-hard in networks with scanwidth at most 3. Further, we design an algorithm that computes the APD of a given set of taxa in O(2^s ⋅ n) time, given a width-s tree-extension, with n vertices of the input network. Finally, we give a linear-time algorithm for computing the APD of a given set of taxa if the network induced by these taxa is reticulation-visible. We generalize this algorithm to an FPT algorithm with respect to the maximum number of invisible reticulations of any biconnected component of the induced network, assuming the indegrees are bounded by a constant.
@InProceedings{vaniersel_et_al:LIPIcs.IPEC.2026.4,
author = {van Iersel, Leo and Jones, Mark and Schestag, Jannik and Scornavacca, Celine and Weller, Mathias},
title = {{Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {4:1--4:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.4},
URN = {urn:nbn:de:0030-drops-281774},
doi = {10.4230/LIPIcs.IPEC.2026.4},
annote = {Keywords: phylogenetic diversity, phylogenetic networks, network phylogenetic diversity, algorithms, computational complexity}
}