skip to content

Reconciling Gene Trees in the Presence of Incomplete Lineage Sorting and Hybridization

Tuesday 21st June 2011 - 09:00 to 10:00
INI Seminar Room 1
In this talk, I will describe our work on two problems:

1. Inference of species trees from gene trees whose incongruence is assumed to be due to incomplete lineage sorting. Here, I will describe extension of the Minimize Deep Coalescence criterion to deal with gene tree estimates that may be unrooted, incompletely resolved, or both.

2. Inference of hybridization from gene trees, in the presence of incomplete lineage sorting. Here, I will describe our work on extending the concept of coalescent histories to phylogenetic networks, and how hybridization can be detected despite incomplete lineage sorting under both a maximum parsimony setting and a maximum likelihood setting.

The performance of the methods on both biological and simulated data will be shown.
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