Monday, July 13

Computational Biology

10:30 AM-12:30 PM
Chair: James F. Lynch, Clarkson University
Room: Sidney Smith Hall 1074

10:30 Unstable Random Boolean Cellular Automata
James F. Lynch, Clarkson University
10:50 Optimally Partitioning Marker Sets by Graph Coloring Methods
Zohar Yakhini, Hewlett Packard Laboratories, Haifa, Israel; Peter Webb, Hewlett Packard Laboratories, Palo Alto; and Ron M. Roth, Hewlett Packard Laboratories, Haifa, Israel
11:10 An Optimal On-Line Algorithm to Compute All the Covers of a String
Yin Li, McMaster University, Hamilton, Canada; and W. F. Smyth, McMaster University and Curtin University of Technology, Hamilton, Canada
11:30 Optimization of DNA Sequencing Experiments
Allon G. Percus, and David C. Torney, Los Alamos National Laboratory
11:50 A Branch--and--Price Algorithm for Minimum Routing Cost Trees
Giuseppe Lancia, Università di Padova, Italy; and Paolo Serafini, Università di Udine, Italy
12:10 On the Variance of the Random Sphere of Influence Graph
Pawel Hitczenko, North Carolina State University; S. Janson, Uppsala University, Sweden; and J. E. Yukich, Lehigh University
Program Program Overview Program-at-a-Glance Program Updates Speaker Index Registration Hotel Transportation

MMD, 5/19/98