Monday, April 07, 2008
11:00 AM
CSB 209
Dr. Max Alekseyev
University of California, San Diego
Genome Rearrangements: from Biological Problems to Combinatorial Algorithms (and back)
Recent large-scale sequencing projects fueled the comparative 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 Phylogenomics, and three related challenging combinatorial problems: Genome Halving Problem, Breakpoint Re-Use Problem, and Multiple Ancestral Genomes Reconstruction Problem. I have recently addressed these problems within a new "Multi-Break Rearrangements" framework that simplified their analysis and led to efficient algorithmic solutions. I have further applied the developed algorithms to sequenced mammalian genomes to study the biological problems mentioned above.

Bio: Max Alekseyev is a Postdoctoral Fellow of Computer Science and Engineering at the University of California, San Diego. He received his PhD in Computer Science from UCSD in 2007. Prior to joining UCSD in 2001, he was a Lecturer and Researcher in th Department of Computational Mathematics & Cybernetics at Nizhni Novgorod State University in Russia. His research interests include computational molecular biology/bioinformatics, comparative genomics, graph theory, combinatorics and discrete algorithms. He is a regular contributor to the Online Encyclopedia of Integer Sequences where he extended many computationally hard sequences, some of which also resulted in contributions to MathWorld, a famous web resource on mathematics.

Refreshments will be provided at 10:45