Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Tree Containment Parameterized by Scanwidth
Leo van Iersel, Mark Jones, Mathias Weller
TREE CONTAINMENT is a central decision problem in mathematical phylogenetics, asking whether a given rooted phylogenetic tree is embeddable in ("displayed by") a given rooted phylo…
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…