The Second Sandia National Laboratories Workshop on

Computational Molecular Biology

March 4-6, 1996

Albuquerque, New Mexico

Program

Sunday, March 3

7:00-9:00 Reception

Monday, March 4

8:00-8:30 Reception and registration
8:30-9:30 Introductory Remarks
Sorin Istrail
Workshop Chair
Sandia National Labs
Bill Camp
Director of Computational Sciences, Computer Sciences and Mathematics Center
Sandia National Labs
Greg Haas
Deputy Director of DOE MICS Office of Scientific Computing
David Smith
Director of the DOE Human Genome Project
Paul Gilman
Executive Director of Commission on Life Sciences
National Research Council, National Academy of Sciences
9:30-12:25 Session 1
Sorin Istrail (Sandia National Laboratories), Chair
- 9:30-10:20
  Plenary Lecture: Protein Folding: Simple Computational Models
  Ken Dill
  Department of Pharmaceutical Chemistry, University of California San Francisco
- 10:35-11:25
  Plenary Lecture: Combinatorial Aspects of Restriction Mapping
  Richard Karp
  Department of Computer Science, University of Washington
- 11:40-12:15
  Gene Recognition: Combinatorics versus Statistics
  Pavel Pevzner
  Department of Mathematics and Molecular Biology, University of Southern California
12:25-2:00 Lunch Break
2:00-5:00 Session 2
Hans Frauenfelder (Los Alamos National Laboratory), Chair
- 2:00-2:35
  Heuristics for Searching Sequence Databases
  Stephen Altschul
  National Center for Biotechnology Information, NIH
- 2:45-3:20
  Neural Network Representations of Empirical Protein Potentials
  Tal Grossman(*) and Alan Lapedes
  Los Alamos National Laboratory
- 3:30-4:05
  Efficient Algorithms for Inverting Evolution
  Martin Farach
  Department of Computer Science, Rutgers University
- 4:15-4:50
  Algorithmic Strategies for Hydrophobic Core Formation for Protein Folding
  William Hart
  Sandia National Laboratories
5:00-5:30 Discussion Session
Jonathan King, Chair
5:30-7:00 Poster Session

Tuesday, March 5

9:00-12:15 Session 3
Paul Gilman (National Academy of Sciences), Chair
- 9:00-9:50
  Plenary Lecture: A New Method for Shotgun Sequence Assembly
  Michael Waterman
  Department of Mathematics and Molecular Biology, University of Southern California
- 10:05-10:55
  Plenary Lecture: Mathematical Issues in Molecular Recognition
  Irwin Kuntz
  Department of Pharmaceutical Chemistry, University of California San Francisco
- 11:10-12:00
  Plenary Lecture: Protein Folding, Protein Misfolding, and Human Disease
  Jonathan King
  Department of Biology, Massachusetts Institute of Technology
12:15-2:00 Lunch Break
2:00-4:15 Session 4
William Hart (Sandia National Laboratories), Chair
- 2:00-2:35
  What makes protein folding cooperative?
  Sarina Bromberg
  University of California San Francisco
- 2:45-3:20
  How Hard is the Integration of Physical Maps?
  Ron Shamir
  Department of Computer Science, Tel-Aviv University
- 3:30-4:05
  New Models for Inferring Consensus Trees
  Tandy Warnow
  Department of Computer Science, University of Pennsylvania
6:00 Dinner Banquet and Discussion Session
Pavel Pevzner, Chair
High Finance Restaurant atop Sandia Peak (10,378 feet)

Wednesday, March 6

9:00-12:00 Session 5
Steve Plimpton (Sandia National Laboratories), Chair
- 9:00-9:35
  The Data Management Systems Used to Map the Human and Mouse Genomes at the Whitehead Institute/MIT Center for Genome Research
  Nat Goodman
  Whitehead Institute/MIT Center for Genome Research
- 9:45-10:20
  Lawler's taxonomy of problems in Phylogeny and Alignment. (Dedicated to the memory of Eugene Lawler)
  R. Ravi
  Department of Operations Research, Carnegie-Mellon University
- 10:30-11:05
  Computing Optimal Multiple Sequence Alignments
  John Kececioglu
  Department of Computer Science, University of Georgia
- 11:15-11:50
  Protein Structure Prediction by Threading
  Steve Bryant
  National Center for Biotechnology Information, NIH
12:00-2:00 Lunch Break
2:00-4:15 Session 6
Nat Goodman (MIT and Whitehead Institute), Chair
- 2:00-2:35
  Constructing Evolutionary Trees in the Presence of Polymorphic Characters
  Cynthia Phillips
  Sandia National Laboratories
- 2:45-3:20
  Mapping Clones with A Given Ordering or Interleaving
  Tao Jiang
  Department of Computer Science, University of Washington
- 3:30-4:05
  Graph Traversals, Genes and Matroids: A TSP Result Arising from Sequencing by Hybridization
  Dan Gusfield
  Department of Computer Science, University of California at Davis

(*) A tragic accident ended the promising career of Tal Grossman. Alan Lapedes, Tal's coauthor and postdoc advisor, will present this talk in his memory.

wehart@cs.sandia.gov
Thu Jul 27 14:30:08 MDT 1995