skip to content

MIP models for phylenetic reconstruction under minimum evolution

Thursday 20th December 2007 - 10:40 to 11:00
INI Seminar Room 1
Session Chair: 
Daniel Huson

Molecular phylogenetics provides several criteria to select a phylogeny among plausible alternative ones. Usually, such criteria can be expressed in terms of objective functions, and the phylogenies optimizing them are referred as optimal. One of the most important criteria is Minimum Evolution (ME) which states that the optimal phylogeny for a given set of organisms is the one whose sum of the edge weights is minimal. Finding the phylogeny satisfying the minimum evolution criterion involves the solution of an optimization problem, called Minimum Evolution Problem (MEP), notoriously NP-Hard. Herewith, we introduce a number of mixed integer programming models and provide possible cuts and lower bounds for the optimal value.

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