Dan Adkins is a programmer at Google. He plans to pursue industrial computer science research. Dan’s thesis developed provably good algorithms for inferring evolutionary history from DNA and gene-order data. In his free time, Dan rides and sometimes races bicycles.
University of California, Berkeley
A Minimum Spanning Tree Framework for Inferring Phylogenies