Tuesday, June 18
1:30-3:00 PM
Room 301

Discrete Algorithms in Computational Biology

Computational molecular biology is a rich source of combinatorial problems with potentially profound impact. The minisymposium will touch on four diverse problem areas will be represented. Multiple sequence alignment seeks to align a set of sequences to reveal their common structure. Genome rearrangements seeks to explain the differences between two organisms by the fewest chromosomal events. Phylogenetic tree construction seeks the tree that best explains the evolution of a set of species. Protein folding seeks the conformation of an amino-acid molecule of lowest free energy. The speakers will present new algorithms that employ discrete methods to find optimal or provably near-optimal solutions to these problems.

Organizer: John D. Kececioglu
University of Georgia

1:30 Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree
John D. Kececioglu, Organizer
2:00 Computing the Local Consensus of Trees
Tandy Warnow, University of Pennsylvania
2:30 Transforming Men Into Mice (A Polynomial-Time Algorithm for Genomic Distance)
Pavel Pevzner, Pennsylvania State University
3:00 Fast Protein Folding in the Hydrophobic-Hydrophilic Model Within Three-Eighths of Optimal
Sorin Istrail, Sandia National Laboratories

Registration | Hotel Information | Dormitory Information | Transportation | Speaker Index

MEM, 3/21/96