skip to content
 

Optimising phylogenetic diversity across two trees

Date: 
Tuesday 18th December 2007 - 11:50 to 12:10
Venue: 
INI Seminar Room 1
Session Chair: 
Stephen Willson
Abstract: 

We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-sum of the phylogenetic diversity across two phylogenetic trees. This resolves one of the challenges proposed at the 'Current Challenges and Problems in Phylogenetics' workshop in the first week of the Phylogenetics programme. It also completely closes the gap between optimizing phylogenetic diversity on one tree, which is known to be in P, and optimizing phylogenetic diversity across three or more trees, which is known to be NP-hard.

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons