skip to content
 

Optimal realisations

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

For a metric $(X,d)$ a weighted graph $G= (V, E, w)$ is called a realization of $d$ if (i) $X \subseteq V$ (ii) $d_g(x,y) = d(x,y)$ for all $x, y \in X$.

A realization is called {\em optimal} if the sum $\sum_{xy \in E} w(xy)$ is minimal among all the realizations. It is known that to find an optimal realization is NP-hard in general. But for the case of a tree-metric, i.e. a metric coming from a tree, it is the underlying (weighted) tree.

in this talk I will discuss properties of optimal realizations and why they are useful for the area of phyogenetic methods

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.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons