Sunday, January 9

Session 4C

4:00 PM-6:05 PM
Room: Gold Rush B

4:00 Algorithmic Strategies in Combinatorial Chemistry
Deborah Goldman, University of California, Berkeley; Sorin Istrail, Sandia National Laboratories, Albuquerque; Giuseppe Lancia, UniversitÓ degli Studi di Padova, Italy; Antonio Piccolboni, University of California, Davis; and Brian Walenz, Sandia National Laboratories, Albuquerque
4:25 Computing the Quartet Distance Between Evolutionary Trees
David Bryant, University of Montreal, Canada; John Tsang, Paul Kearney, and Ming Li, University of Waterloo, Canada
4:50 A Practical Algorithm for Recovering the Best Supported Edges of an Evolutionary Tree
David Bryant, University of Montreal, Canada; Vincent Berry, UniversitÚ de Montpellier II, France; Paul Kearney and Ming Li, University of Waterloo, Canada; Tao Jiang and Todd Wareham, McMaster University, Canada; and Haoyong Zhang, University of Waterloo, Canada
5:15 Pattern Discovery on Character Sets and Real-valued Data: Linear Bound on Irredundant Motifs and an Efficient Polynomial Time Algorithm
Laxmi Parida, Yuan Gao, Dan Platt, Aris Floratos, and Isidore Rigoutsos, IBM T. J. Watson Research Center
5:40 Improved Bounds on the Sample Complexity of Learning
Yi Li and Philip M. Long, National University of Singapore, Singapore; and Aravind Srinivasan, Bell Laboratories, Lucent Technologies

© 1999, Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 11/7/99; Last Updated 11/7/99