CSU HAYWARD

DEPARTMENT OF MATHEMATICS AND

COMPUTER SCIENCE

COLLOQUIUM

Friday, May 30, 2003; Noon-1:00pm Sc N321

Speaker: K. Balasubramanian
   Department of Applied Science, University of California, Davis
   Chemistry & Material Science Directorate, Lawrence Livermore National Laboratory
   Glenn T. Seaborg Center, Lawrence Berkeley National Laboratory, Berkeley

Research Opportunities in Applied Computer Science: Combinatorics, Graph Theory, Bioinformatics

The talk will exemplify exciting applications of combinatorics, graph theory based algorithms to a number of scientific disciplines, particularly chemistry and biology. Enumerative combinatorics and algorithms find numerous applications to (1) enumeration of structures of molecules (2) three dimensional cages called fullerenes discovery of which led to the Nobel Prize (3) Nuclear spin statistics and spectroscopy. Cross fertilization of graph theory with chemistry and biology seems to provide an exciting fertile ground for interdisciplinary research in bioinformatics, predictive toxicology, molecular and drug design. Examples of applications from each of these fields will be provided and would include DNA algorithm and graph theoretical characterization of proteomics and genomics.

 

Please join us beforehand for Pizza!!!!