Tuesday, July 14

Computational Molecular Biology

3:30 PM-6:00 PM
Room: Sidney Smith 2118

The exponential growth of molecular biology information and Human Genome data has generated a new discipline, sometimes called bioinformatics, that aims to collect, organize and analyze the huge quantities of biological information. This minisymposium addresses a critical component of this discipline, the design and analysis of algorithms for computational problems arising in molecular biology. The speakers will report on state of the art research in some central problems, including sequence alignment, genomic rearrangements and mapping. All these problems give rise to elegant, yet highly relevant, combinatorial optimization problems. No biological background is required to follow the talks.

Organizer: Ron Shamir
Tel Aviv University, Israel and University of Washington
Chair: R. Ravi,
Carnegie Mellon University
3:30 Halving the Genome
David Sankoff, Université de Montreal, Canada
4:00 Transforming Cabbage into Turnip: A Computational Theory of Genome Rearrangements
Sridhar Hannenhalli, SmithKline Beecham Pharmaceuticals; and Pavel Pevzner, University of Southern California
4:30 Physical Mapping with Non-Unique Probes: The Hypergraph Superstring Problem
Serafim Batzoglou, Massachusetts Institute of Technology; and Sorin Istrail, Sandia National Laboratories
5:00 Minimum Routing Cost Spanning Trees and Multiple Sequence Alignments
Bang Ye Wu, National Tsing Hua University, Republic of China; Giuseppe Lancia, Università di Padova, Italy; Vineet Bafna, SmithKline Beecham Pharmaceuticals; Kun-Mao Chao, Providence University, Taiwan; R. Ravi, Carnegie Mellon University; and Chuan Yi Tang, National Tsing Hua University, Taiwan
5:30 Algorithms for Optical Mapping of DNA
Richard M. Karp, University of Washington; and Ron Shamir, Organizer
Program Program Overview Program-at-a-Glance Program Updates Speaker Index Registration Hotel Transportation

LMH, 2/23/98; MMD, 6/5/98