Computer science colloquia
Date/Time: | Thursday, 10 Sep 2009 at 3:40 pm |
---|---|
Location: | B29 Atanasoff |
Cost: | Free |
Phone: | 515-294-1098 |
Channel: | Groups, governance |
Categories: | Lectures |
Actions: | Download iCal/vCal | Email Reminder |
Gorecki will present a model of reconciling unrooted gene tree with a rooted species tree. This approach is based on a concept of choosing rooting, which has minimal reconciliation cost. The analysis leads to the surprising property that all the minimal rootings have identical distributions of gene duplications and gene losses in the species tree. It implies that the concept of an optimal rooting is very robust, and thus biologically meaningful. A linear time and space algorithm for computing optimal cost and rooting(s) also will be presented with some applications.