Friday, May 14

MS37
Computational Biology

(Invited Minisymposium)

10:30 AM-12:30 PM
Room: Atlanta 3

Many of the most compelling problems in biology remain unsolved, and will require significant input from mathematicians (especially discrete mathematicians) in order to be solved. Some of these problems include DNA sequencing, evolutionary tree reconstruction, physical mapping, protein structure and function prediction, and the search for regulatory regions. In this minisymposium, the speakers will describe new approaches towards solving some of these hardest problems in computational biology. No knowledge of biology is needed to understand the problems.

Organizer: Tandy J. Warnow
University of Arizona

10:30-10:55 A New Computational Strategy for Searching Genomic DNA Sequences for Regulatory Regions

Craig J. Benham, Mount Sinai School of Medicine

11:00-11:25 Boosting the Performance of Methods for Reconstructing Very Large Evolutionary Trees

Tandy J. Warnow, Organizer; and Scott Nettles, University of Arizona; and Daniel Huson, Princeton University

11:30-11:55 Whole Genome Shotgun Sequencing

Gene Myers, Celera Genomics, Rockville, Maryland

12:00-12:25 Reconstructing Evolutionary Trees Using Algebraic Varieties

Junhyong Kim and Kevin Atteson, Yale University

AN99 Home

Program

Program Updates

Speaker Index

Hotel

Transportation

Registration

LMH, 1/20/99, MMD, 1/27/99