3 papers
cs.DS2026
Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
Leo van Iersel, Mark Jones, Jannik Schestag +2
We investigate parameterized algorithms for computing the average-tree phylogenetic diversity (APD) in rooted phylogenetic networks, studying the problem under different structural…
math.CO2026
A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
Leo van Iersel, Mark Jones, Simone Linz +1
A directed phylogenetic network is tree-child if every non-leaf vertex has a child that is not a reticulation. As a class of directed phylogenetic networks, tree-child networks are…
cs.DS2025
Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
Mark Jones, Jannik Schestag
For a phylogenetic tree, the phylogenetic diversity of a set A of taxa is the total weight of edges on paths to A. Finding small sets of maximal diversity is crucial for conservati…