University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Reconciling Gene Trees in the Presence of Incomplete Lineage Sorting and Hybridization

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

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Phylogenetics

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.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity