Genome Rearrangements: from Biological Problems to Combinatorial Algorithms (and back)

Tuesday, April 20, 2010 - 4:34pm


FRIDAY, MAY 28, 2010
10:00 AM Reception
10:30 AM – 11:30 AM
Engineering Sciences Building, Room 1001

HOST: Ambuj Singh

Computer Science, UC San Diego

Title: 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 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.


Pavel Pevzner holds the Ronald R. Taylor Chair in Computer Science at
UCSD. He received his Ph.D in 1988 from Moscow Institute of Physics and
Technology. Pevzner is the author of the textbooks “Computational Molecular
Biology: An Algorithmic Approach” (2000) and “Introduction to
Bioinformatics Algorithms” (2004). He is an executive editor of the
“Journal of Computational Biology,” and co-founder of the International
Conference on
Research in Computational Biology (RECOMB). In 2006 he was named HHMI
Professor. In 2010 he was elected to the Board of Directors of the Human
Proteome Organization. He directs the Interdisciplinary Graduate Program
in Bioinformatics and Systems Biology and the Center for Algorithmic and
Systems Biology at UCSD. Since 2008 he directs the NIH/NCRR Center for
Computational Mass Spectrometry at UCSD.