Graduate Student Seminar

Title:  Mathematical models and algorithms for genome rearrangements and genome assembly

Speaker:  Sergey Aganezov

Abstract:  My research revolves around mathematical modeling and algorithms development in the area of computational biology, and more precisely, genome assembly as well as ancestral genome reconstruction and comparative genome rearrangement analysis. The objective is to incorporate existing and develop new graph theoretical and combinatorial methods to tackle the problem of in silico finishing existing incomplete genome assemblies. We will cover the following topics: mathematical models of genomes rearrangements, various genome rearrangement distances (metrics) and their computational complexity, whole genome assembly, de novo / reference genome assembly, phylogenetic analysis of multiple genomes and quality improvement of existing genome assemblies by utilizing genome rearrangement analysis.