City: Test Saint Petersburg Novosibirsk Kazan Language: Русский English

Genome Rearrangements: from Biological Problems to Combinatorial Algorithms (Pavel Pevzner, University of California at San Diego, USA)
Seminar on Computer Science

What: Lecture
When: Thursday, 09 December 2010, 18:30–20:55
Slides: csseminar_lecture_091210.pdf


Recent breakthroughs in the next-generation DNA sequencing fueled the genomics studies and revealed that some classical biological theories may be incomplete or even incorrect. I describe three controversial and hotly debated topics: Whole Genome Duplications, Random Breakage Model of Chromosome Evolution, and Mammalian Evolution, and three related challenging algorithmic problems: Genome Halving Problem, Breakpoint Re-Use Problem, and Ancestral Genome Reconstruction Problem. I further describe the Multi-Break Rearrangements framework that simplified analysis of these biological problems, led to efficient algorithmic solutions, and provided new evolutionary insights.

Second part of the presentation: