Home > Archives > Additional Archives > Susan Holmes
 
Susan Holmes
Visiting Associate Professor
Department of Statistics
Standford University
susan@stat.Stanford.edu

Computing with Trees
 
This work presents a natural coordinate system for `trees' using a correspondence with the set of perfect matchings in the complete graph. This correspondence produces a distance between trees, and a way of enumerating all trees in a minimal step order. It is useful in randomized algorithms as it enables moves on the space of trees that make random optimization strategies `mix' quickly. It also promises a generalization to intermediary trees when data are not decisive as to their choice of tree, and a new way of constructing Bayesian priors on tree space. This representation provides a nice way of implementing genetic algorithms for approximately optimizing criteria such as parsimony and maximum likelihood, known to be NP complete. This work applies to the space of all phylogenetic trees for a given set of species, it also extends to the space of all decision trees of a certain complexity measured in terms of the number of observations and to the analysis of DNA micro-arrays.



Here is the list of the other talks to be given by Susan Holmes and Persi Diaconis during the week of April 10-14, 2000.

  • Monday, April 10, 1--2 p.m., SAN DIEGO SUPERCOMPUTER CENTER AUDITORIUM
    (Joint seminar sponsored by the Mathematics Department and the Computational Science Seminar Series) Susan Holmes (Stanford University)
    "Computing with Trees" (joint work with Persi Diaconis)
  • Tuesday, April 11, 2000, 2.30-3.30 p.m., probably in AP 7421
    Special Probability and Mathematics Education Seminar
    Susan Holmes (Stanford University)
    "Probability by surprise: Teaching with Paradoxes"
  • Tuesday, April 11, 2000, 4-5 p.m., AP 7421, Mathematics Colloquium
    Persi Diaconis (Stanford University)
    "The Mathematics of Solitaire"
  • Wednesday, April 12, 2000, time to be announced, probably 12.05pm in AP 7421
    Special Probability Seminar
    Persi Diaconis (Stanford University) "Random walk and Hecke algebras"
  • Thursday, April 13, 2000, 10.10 a.m., probably in AP 7421
    Probability Seminar
    Persi Diaconis (Stanford University)
    "New relations between unitary matrices and the zeros of Riemann's zeta function"
  • Thursday, April 13, 2000, 4 p.m., AP 7421, Mathematics Colloquium
    Susan Holmes (Stanford University)
    "Geometry of the Space of Family Trees" (joint work with
    Louis Billera and Karen Vogtmann)
   
  Home | SDSC | UCSD | Campus Map | Contact Info
   
 
  The San Diego Supercomputer Center (SDSC) is a research unit of the University of California, San Diego, and the leading-edge site of the National Partnership for Advanced Computational Infrastructure. SDSC researchers conduct studies in computational science, develop high-performance computing and networking technologies, and participate in NPACI activities.

SDSC -- UC San Diego, MC 0505 -- 9500 Gilman Drive -- La Jolla, CA 92093-0505 -- 858-534-5000 -- 858-534-5152 (fax)
info@sdsc.edu © 2001, The Regents of the University of California