Tandy Warnow
Contact
Department of Computer Sciences
The University of Texas at Austin
Taylor Hall 2.124
Austin, TX 78712-1188
phone: +1 (512) 471 9724
fax: +1 (512) 471 8885
Personal Homepage
Education
| 1991 | Ph.D. University of California, Berkeley, Mathematics |
|---|---|
| 1992-1993 | Postdoc at Sandia National Laboratories |
Academic Positions
| 1993-1998 | Assistant Professor in the Department of Computer Sciences at the University of Pennsylvania |
|---|---|
| 1998-1999 | Associate Professor (tenured), Department of Computer Sciences, the University of Pennsylvania. |
| 1999-2003 | Associate Professor, Department of Computer Sciences The University of Texas at Austin |
| 2003-present | Professor Department of Computer Sciences The University of Texas at Austin |
Research interests
I work on evolutionary history methodology and algorithms in Biology and Historical Linguistics. My recent work focuses on four major issues, all related toevolutionary history reconstruction:- The analytical study of convergence rates of different methods, and thedevelopment of provablyfast converging methods.
- Fast techniques for NP-hard optimization problems, such asmaximum likelihood and maximum parsimony.Our research projecthas produceda very powerful technique called "Rec-I-DCM3" fordramatically speeding upeven the bestof the current heuristics for maximum parsimonyon large dataset analyses.
- The inference of complex evolutionaryhistories. In this area, I have focusedon the inference of evolution fromwholegenomes, andthe detection and inference of reticulate evolution.
- Computational phylogenetics in historical linguistics(see alsothis page).
Select Publications
- T. Warnow, S.N. Evans, D. Ringe, and L. Nakhleh,"A stochastic model of language evolution that incorporates homoplasy andborrowing."Invited paper, to appear in Cambridge University Press,for a special volume on Phylogenetic Methods and the Prehistory of Languages.
- L. Nakhleh, D. Ringe, and T. Warnow,"Perfect Phylogenetic Networks: A New Methodologyfor Reconstructing the EvolutionaryHistory of Natural Languages."To appear, Language (Journal of theLinguistic Society of America), 2005.
- U. Roshan, B.M.E. Moret, T.L. Williams, and T. Warnow,"Rec-I-DCM3: A fast algorithmic technique forreconstructing large phylogenetic trees,"Proc. IEEE Computer Society Bioinformatics Conference CSB 2004, Stanford U.,2004.(PDF)
- L. Nakhleh, K. St. John, U. Roshan, J. Sun,and T. Warnow, 2001."Designing fast converging phylogenetic methods."9th Int'l Conf. on Intelligent Systems for Molecular Biology(ISMB 2001), Copenhagen, in Bioinformatics 17, Suppl. 1, (2001),pp. S190-S198.(PDF)
- T. Warnow, B.M.E. Moret, and K. St. John. 2001.Absolute Convergence:True Trees From Short Sequences.ACM-SIAM Symposium on Discrete Algorithms (SODA) 2001.(PS)
- L. Nakhleh, U. Roshan, K. St. John, J. Sun, and T. Warnow, 2001."The performance of phylogenetic methods on trees of bounded diameter."Proceedings, The First International Workshop on Algorithmsin Bioinformatics (WABI), 2001, Lecture Notes in Computer Science(LNCS #2149) pp. 214-226, Springer Verlag, Olivier Gascuel and BernardM.E. Moret, eds.(PDF)