EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2276. The Robust Diversity Difference Problem
Invited abstract in session WD-25: Topics in Combinatorial Optimization II (Contributed), stream Combinatorial Optimization.
Wednesday, 14:30-16:00Room: 011 (building: 208)
Authors (first author is the speaker)
| 1. | Martin Frohn
|
| 2. | Kerry Manson
|
| University of Canterbury |
Abstract
A phylogeny is an edge-weighted binary tree with leaves labeled by a collection of species that represents the evolutionary relationships between the species. Given a phylogeny, a popular measure for the biodiversity of a subset of the species is the phylogenetic diversity, defined by the sum of the edge weights in a minimal spanning subtree of the phylogeny leaf-labelled by the subset. However, if we want to make conservation efforts for particular species, then we consider a phylogenetic diversity index, a function that apportions the biodiversity of a subset across all of its species. In general, for a fixed subset of species, the difference between the phylogenetic diversity and the sum of phylogenetic diversity indices is a non-negative function, called the diversity difference. We study the combinatorics of phylogenetic diversity indices and show that the maximum robust diversity difference for a fixed number of species can be calculated in polynomial time. Furthermore, we provide computational evidence to compare the quality of the optimal robust diversity difference index with other popular phylogenetic indices from the literature in practice.
Keywords
- Robust Optimization
- Programming, Linear
- Computational Biology, Bioinformatics and Medicine
Status: accepted
Back to the list of papers