From the 1 of 6 linked papers with an AI index.
6 papers
Maximizing All-Paths Phylogenetic Diversity: Parameterized Approaches for Networks
Mark Jones, Jannik Schestag
The paper investigates the problem of maximizing a generalized phylogenetic diversity measure on directed acyclic phylogenetic networks, showing hardness results and presenting fix…
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…
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…
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…
Phylogenetic Network Diversity Parameterized by Reticulation Number and Beyond
Leo van Iersel, Mark Jones, Jannik Schestag +2
Network Phylogenetic Diversity (Network-PD) is a measure for the diversity of a set of species based on a rooted phylogenetic network (with branch lengths and inheritance probabili…
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…