skip to content
 

Approximating phylogenetic tree distances

Presented by: 
K St John [New York]
Date: 
Tuesday 11th December 2007 - 14:00 to 15:00
Venue: 
INI Seminar Room 2
Abstract: 

Many popular distances between phylogenetic trees are difficult to calculate. These include the subtree-prune-reconnect (SPR) and the tree-bisection-reconnection (TBR) distances. We will survey the complexity results for these distances and discuss recent efforts to give approximation algorithms to these important metrics.

University of Cambridge Research Councils UK
    Clay Mathematics Institute The Leverhulme Trust London Mathematical Society Microsoft Research NM Rothschild and Sons