Reconciling Gene Trees in the Presence of Incomplete Lineage Sorting and Hybridization
Seminar Room 1, Newton Institute
AbstractIn 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.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.