Some Talks

Large trees from short sequences: Recent theoretical insights
Lens11, IPAM, Penn
Phylogeny estimation: Beyond the classical model of sequence evolution
MIT, Berkeley, GA Tech
Alignment-free phylogenetic reconstruction
RECOMB10
Probabilistic techniques in mathematical phylogenetics
SCPS09
Phylogenies without branch bounds
RECOMB09, CIPRES Meeting
Reconstructing Markov models on trees beyond the KS transition
Complexity in Jerusalem
Phylogeny reconstruction: Are distance methods as accurate as maximum likelihood?
Berkeley, FOCS08, MIT, Brown, UCLA
Diffusion of Influence in Social Networks
Microsoft Research, UC Berkeley, IPAM, STOC07, Cornell, UCSD, Duke, UBC
Big Trees from Short Sequences: Recent Theoretical Progress
Microsoft Research, Columbia, UBC
Markov Models on Trees: Reconstruction and Applications
MIT, UCSD, DIMACS, UCLA, UMN
Broadcasting on Trees: On the Tightness of a Bound of Kesten and Stigum
FOCS06, UC Berkeley, Cornell
Phase Transitions in Phylogeny: New "Optimal" Reconstruction Algorithms
Isaac Newton Institute, Bay Area Biosystematists Meeting
From Darwin's Finches to Forensic Science: A Quick Tour of Statistical Phylogenetics
UC Berkeley
Optimal Phylogenetic Reconstruction
STOC05, UCLA
On the Reconstruction of Stochastic Models on Trees
Microsoft Research
Inferring Evolutionary Histories by Likelihood Methods: Computational Hardness
CIPRES Meeting, Harvard
Learning Nonsingular Phylogenies
STOC, UC Berkeley
Design and Analysis of an Approximation Algorithm for Stackelberg Network Pricing
McGill University, Optimization Days
last modified: october 1, 2011