Presentation Title

A Consolidation Algorithm for Fractionated Genomes Without a Reference

Format of Presentation

15-minute lecture to be presented the Saturday of the conference

Abstract

After a genome duplication event, genes are deleted essentially at random from duplicated regions in a process called fractionation. This fractionation of the genome can lead to overestimation of the evolutionary distance between species. Software to identify these regions and correct for the distortion caused by fractionation is available, but it relies upon an "ancestor" genome which did not experience a duplication event for reference. This means that the distortion cannot be corrected for some species when a reference genome is not available. To gain a better understanding of the evolutionary history of these species, we are developing software to identify fractionated regions with a consolidation algorithm that does not require a reference genome.

Department

Computing Science

Faculty Advisor

Lingling Jin

This document is currently not available here.

Share

COinS
 

A Consolidation Algorithm for Fractionated Genomes Without a Reference

After a genome duplication event, genes are deleted essentially at random from duplicated regions in a process called fractionation. This fractionation of the genome can lead to overestimation of the evolutionary distance between species. Software to identify these regions and correct for the distortion caused by fractionation is available, but it relies upon an "ancestor" genome which did not experience a duplication event for reference. This means that the distortion cannot be corrected for some species when a reference genome is not available. To gain a better understanding of the evolutionary history of these species, we are developing software to identify fractionated regions with a consolidation algorithm that does not require a reference genome.