1. S. Kannan and T. Warnow, 1992. Triangulating Three-Colored Graphs, SIAM J. on Discrete Mathematics, Vol. 5 No. 2, pp. 249-258. (A preliminary version appeared in the Proceedings of the ACM/SIAM Symposium on Discrete Algorithms, 1991.)

2. H. Bodlaender, M. Fellows, and T. Warnow, 1992. Two strikes against perfect phylogeny, Proceedings, International Colloquium on Automata, Languages and Programming. Springer Verlag Lecture Notes in Computer Science, volume 623. pp. 273-283.

3. M. Steel and T. Warnow, 1993. Kaikoura Tree Theorems: The Maximum Agreement Subtree Problem. Information Processing Letters, 48, pp. 77-82.

4. T. Warnow, 1993. Constructing phylogenetic trees efficiently using compatibility criteria. New Zealand Journal of Botany, Vol. 31, pp. 239-248.

5. S. Kannan and T. Warnow, 1994. Inferring Evolutionary History from DNA Sequences. SIAM J. on Computing, Vol. 23, No. 4, pp. 713-737. (A preliminary version of this paper appeared at FOCS 1990.)

6. T. Warnow, 1994. Tree Compatibility and Inferring Evolutionary History. Journal of Algorithms, 16, pp. 388-407. (A preliminary version of this paper appeared at SODA 1993.)

7. F.R. McMorris, T. Warnow, and T. Wimer, 1994. Triangulating Vertex Colored Graphs. SIAM J. on Discrete Mathematics, Vol. 7, No. 2, pp. 296-306. (A preliminary version of this paper appeared at SODA 1993.)

8. M. Farach, S. Kannan, and T. Warnow, 1995. A Robust Model for Finding Optimal Evolutionary Trees. Algorithmica, special issue on Computational Biology, Vol. 13, No. 1, pp. 155-179. (A preliminary version of this paper appeared at STOC 1993.)

9. S. Kannan and T. Warnow, 1995. Tree Reconstruction from Partial Orders. SIAM J. on Computing, Vol. 24 No. 3, pp. 511-520. (A preliminary version of this paper appeared at WADS.)

10. S. Kannan, T. Warnow, and S. Yooseph, 1998. Computing the local consensus of trees. SIAM J. Computing, vol. 27, no. 6, pp. 1695-1724. (A preliminary version appeared in the Association for Computing Machinery and the Society of Industrial Applied Mathematics, Proceedings, ACM/SIAM Symposium on Discrete Algorithms, 1995, pp. 68-77.)

11. A. Taylor, D. Ringe, and T. Warnow. Character-based reconstruction of a linguistic cladogram. Proceedings of the 12th International Conference on Historical Linguistics (Manchester, August 1995).

12. T. Warnow, D. Ringe, and A. Taylor. Reconstructing the evolutionary history of natural languages. Association for Computing Machinery and the Society of Industrial and Applied Mathematics, Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), 1996, pp. 314-322.

13. C.A. Phillips and T. Warnow, 1996. The Asymmetric Median Tree: a new model for building consensus trees. Discrete Applied Mathematics, Special Issue on Computational Molecular Biology, 71, pp. 311-335.

14. L.A. Goldberg, P.W. Goldberg, C.A. Phillips, E. Sweedyk, and T. Warnow, 1996. Minimizing phylogenetic number to find good evolutionary trees. Discrete Applied Mathematics, Volume 71, Numbers 1-3, pp. 111-136. (A preliminary version of this paper appeared in Combinatorial Pattern Matching 1995)

15. C. Benham, S. Kannan, M. Paterson, and T. Warnow, 1996. Hen's Teeth and Whale's Feet: Generalized Character Compatibility. Journal of Computational Biology. Vol 2. No 4. pp 527-536. (A preliminary version of this appeared in Combinatorial Pattern Matching, 1995.)

16. S. Kannan, E. Lawler, and T. Warnow, 1996. Determining the Evolutionary Tree, Journal of Algorithms, 21(1): 26-50. (A preliminary version of this paper appeared at SODA 1990.)

17.
D. Ringe, T. Warnow, A. Taylor, A. Michailov, and L. Levison, 1997. Computational
cladistics and the position of Tocharian. __I__n V. Mair (Ed.), *The
Bronze Age and Early Iron Age Peoples of Eastern Central Asia*, a special
volume of the Journal of Indoeuropean Studies.

18. P. Erdos, M. Steel, L. Szekely, and T. Warnow, 1997. Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule. Computers and Artificial Intelligence, Number 2, Vol 16, pp. 217-227.

19. T. Warnow, 1997. Mathematical approaches to comparative linguistics. Proceedings of the National Academy of Sciences, Vol. 94, pp. 6585-6590, 1997. (PDF)

20. S. Kannan and T. Warnow, 1997. A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed. SIAM J. Computing, Vol. 26, No. 6, pp. 1749-1763. (A preliminary version appeared in the proceedings of the ACM/SIAM Symposium on Discrete Algorithms, 1995.)

21. K. Rice and T. Warnow, Parsimony is Hard to Beat!, Proceedings, Third Annual International Conference of Computing and Combinatorics (COCOON), Shanghai, China, 1997, pp. 124-133. T. Jiang and D.T. Lee, Eds.

22. P. Erdös, M. Steel, L. Szekeley, and T. Warnow. Inferring big trees from short sequences. Proceedings of International Congress on Automata, Languages, and Programming 1997. Bologna, Italy. (This paper also appears as DIMACS Technical Report 97-71.)

23. D. Huson, S. Nettles, L. Parida, T. Warnow, and S. Yooseph. The Disk-Covering Method for Tree Reconstruction. In R. Battiti and A.A. Bertossi, editors, Proceedings of "Algorithms and Experiments" (ALEX'98), pages 62-75. 1998. Trento, Italy, Feb. 9-11, 1998. (ps)

24. M. Bonet, M. Steel, T. Warnow, and S. Yooseph. Faster algorithms for solving parsimony and compatibility. The Journal of Computational Biology, Vol. 5, No. 3, pp. 409-422. By invitation, for the special issue on selected papers from RECOMB 1998.

25. Huson, D. K. A. Smith and T. Warnow. 1999. "Correcting Large Distances for Phylogenetic Reconstruction." Proceedings, 3rd Workshop on Algorithms Engineering (WAE), London, England, 1999, pp. 273-286.

26. T. Warnow. Some combinatorial problems in phylogenetics. Invited paper, Proceedings of the International Colloquium on Combinatorics and Graph Theory, Balatonlelle, Hungary, July 15-20, 1996, eds. A. Gyarfas, L. Lovasz, L.A. Szekely, Volume 7 of Bolyai Society Mathematical Studies, Budapest, pp. 363-413. Eds. A. Gyárfás, L. Lovász, L.A. Székely.

27. P.L. Erdos, M. Steel, L. Székély, and T. Warnow, 1999. A few logs suffice to build almost all trees - I. Random Structures and Algorithms, 14 (2): 153-184.

28. P.L. Erdos, M. Steel, L. Székély, and T. Warnow. A few logs suffice to build almost all trees - II. Theoretical Computer Science, 221, pp. 77-118, 1999 (by invitation, special issue of selected papers from ICALP 1997.) (Also appears as DIMACS Technical Report 97-72.) (pdf)

29. M. Bonet, C.A. Phillips, T. Warnow, and S. Yooseph, 1999. Constructing evolutionary trees in the presence of polymorphic characters. SIAM J. Computing, Vol. 29. No. 1, pp. 103-131. (A preliminary version appeared in the ACM Symposium on the Theory of Computing, 1996.)

30. M. Henzinger, V. King, and T. Warnow, 1999. Constructing a tree from homeomorphic subtrees, with applications to computational molecular biology. Algorithmica, 24(1): 1-13 (1999). (A preliminary version appeared in the Association for Computing Machinery and the Society of Industrial and Applied Mathematics, Proceedings, ACM/SIAM Symposium on Discrete Algorithms, 1996, pp. 333-340.)

31. D. Huson, S. Nettles, and T. Warnow. Disk-Covering, a fast converging method for phylogenetic tree reconstruction. Special issue of the Journal of Computational Biology for selected papers from RECOMB 1999, Vol. 6, No. 3, 1999, pp. 369-386. (This appeared in a preliminary form in the Proceedings of RECOMB 1999, as Obtaining highly accurate topology estimates of evolutionary trees from very short sequences. Lyon, France.) (pdf) (PS)

32. D. Huson, S. Nettles, K. Rice, T. Warnow, and S. Yooseph. The Hybrid tree reconstruction method. The Journal of Experimental Algorithmics, Volume 4, Article 5, 1999. Special issue for selected papers from The Workshop on Algorithms Engineering, Saarbrucken, Germany, 1998. (pdf).

33. D. Huson, L. Vawter, and T. Warnow. 1999. Solving large scale phylogenetic problems using DCM-2. Proceedings of ISMB (Intelligent Systems for Molecular Biology), (ISMB), Saarbrucken, 1999.

34. J. Kim and T. Warnow. 1999. Tutorial on Phylogenetic Tree Estimation. Intelligent Systems for Molecular Biology, Heidelberg 1999. (PS) (PDF)

35. M.E. Cosner, R.K. Jansen, B.M.E. Moret, L.A. Raubeson, L.-S. Wang, T. Warnow, and S. Wyman. 2000. "A new fast heuristic for computing the breakpoint phylogeny and a phylogenetic analysis of a group of highly rearranged chloroplast genomes." Proceedings of Intelligent Systems for Molecular Biology (ISMB), August 2000. (PS)

36. M. E. Cosner, R. K. Jansen, B.M.E. Moret, L.A. Raubeson, L.-S. Wang, T. Warnow, and S. Wyman, 2000. "An empirical comparison between BPAnalysis and MPBE on the Campanulaceae chloroplast dataset." In Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, D. Sankoff and J. Nadeau, eds., Kluwer Academic, Dordrecht (2000), 99--121. (PS)

37. H.L. Bodlaender, M.R. Fellows, Michael T. Hallett, H. Todd Wareham, and T. Warnow. 2000. The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs, Theoretical Computer Science 244 (2000) 167-188.

38. K. St. John, T. Warnow, B.M.E. Moret, and L. Vawter. 2001. "Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining". Proceedings SODA 2001.

39. G. Ganapathy, and T. Warnow, 2001. "Finding the Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree is Solvable in Polynomial Time." In Proceedings of the First International Workshop on Algorithms and Bioinformatics (WABI), 2001, pp. 156-163, Springer Verlag, Olivier Gascuel and Bernard M.E. Moret, eds. (PS.)

40. 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)

41. L.-S. Wang and T. Warnow. 2001. "Estimating true evolutionary distances between genomes." Proceedings, Symposium on the Theory of Computing (STOC), 2001, pp. 637-646.

42. B.M.E. Moret, S. Wyman, D.A. Bader, T. Warnow, and M. Yan, 2001. "A new implementation and detailed study of breakpoint analysis," Proc. 6th Pacific Symp. on Biocomputing (PSB 2001), Hawaii, World Scientific Pub. (2001), 583-594. (pdf)

43. B.M.E. Moret, L.-S. Wang, T. Warnow, and S.K. Wyman, 2001. "New approaches for reconstructing phylogenies based on gene order,'' 9th Int'l Conf. on Intelligent Systems for Molecular Biology (ISMB 2001), Copenhagen, in Bioinformatics 17, Suppl. 1, (2001), pp. S165-S173; chosen as one of the 5 best papers at the conference. (pdf)

44. 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)

45. 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 Algorithms in Bioinformatics (WABI), 2001, Lecture Notes in Computer Science (LNCS #2149) pp. 214-226, Springer Verlag, Olivier Gascuel and Bernard M.E. Moret, eds. (pdf)

46. B.M.E. Moret, D.A. Bader, and T. Warnow, 2001. "High-performance algorithmic engineering for computational phylogenetics,'' Proc. 2001 Int'l Conf. Computational Science (ICCS 2001), San Francisco (2001), Lecture Notes in Computer Science 2073-2074, Springer Verlag. (pdf)

47. D. Ringe, T. Warnow, and A. Taylor, 2002. "Indo-European and Computational Cladistics", Transactions of the Philological Society, Volume 100: Issue 1, March 2002, pp. 59-129. (pdf)

48. L. Nakhleh, B. M. E. Moret, U. Roshan, K. St. John, J. Sun, and T. Warnow, 2002. "The accuracy of fast phylogenetic methods for large datasets", Proc. 7th Pacific Symposium on BioComputing (PSB02), Kauai, USA (2002), World Scientific Pub, 211-222. (PS) (PDF)

49. G. Ganapathy, and T. Warnow 2002. Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees. In Proceedings of the Fifth International Workshop on Approximation Algorithms for Combinatorial Optimization, pages 122--134, 2002. (PS.)

50. L.-S. Wang, R. Jansen, B. Moret, L. Raubeson, and T. Warnow, 2002. "Fast Phylogenetic Methods For Genome Rearrangement Evolution: An Empirical Study," Proc. 7th Pacific Symp. on Biocomputing (PSB 2002), Hawaii, World Scientific Pub. (2002), 524-535. (PS)

51. B.M.E. Moret, D.A. Bader, and T. Warnow, 2002. "High-performance algorithm engineering for computational phylogenetics,'' J. Supercomputing (22), 99--111, special issue on best papers from ICCS'01. (PS)

52. B.M.E. Moret, U. Roshan, and T. Warnow, 2002. "Sequence length requirements for phylogenetic methods," Proc. 2nd International Workshop on Algorithms in Bioinformatics (WABI'02), Rome (2002), Lecture Notes in Computer Science (LNCS #2452), pp. 343-356, Springer Verlag, Roderic Guigo and Dan Gusfield, eds (pdf)

53. L. Nakhleh, U. Roshan, L. Vawter, and T. Warnow, 2002. "Estimating the deviation from a molecular clock", Proc. 2nd International Workshop on Algorithms in BioInformatics (WABI02), Rome, Italy (2002), Lecture Notes in Computer Science 2452, 287-299, Springer Verlag, R. Guido and D. Gusfield, eds. (pdf)

54. B.M.E. Moret, J. Tang, L.-S. Wang, and T. Warnow, 2002. "Steps toward accurate reconstruction of phylogenies from gene-order data,'' J. Comput. Syst. Sci. (invited, special issue on computational biology), 65, 3 (2002), 508-525. (PS)

55. C. Stockham, L.-S. Wang, and T. Warnow, 2002. "Statistically-Based Postprocessing of Phylogenetic Analysis Using Clustering," Bioinformatics, Vol. 18, Suppl. 1, special issue for the Proceedings of 10th Int'l Conf. on Intelligent Systems for Molecular Biology (ISMB'02). Edmonton, Canada, pp. S285--S293.

56. B.M.E. Moret, L.-S. Wang, and T. Warnow, 2002. "Towards New Software for Computational Phylogenetics," IEEE Computer 35, 7 (July 2002), Special issue on Bioinformatics, pp. 55-64. (PDF)

57. B.M.E. Moret, and T. Warnow, 2002. "Reconstructing optimal phylogenetic trees: A challenge in experimental algorithmics," Lecture Notes in Computer Science 2547, Springer Verlag, 2002, 163-180 (2002). (PDF)

58. L. Nakhleh, J. Sun, T. Warnow, C.R. Linder, B.M.E. Moret and A. Tholse, 2003. "Towards the development of computational tools for evaluating phylogenetic network reconstruction methods," Proc. 8th Pacific Symp. on Biocomputing (PSB 2003), January 2003. (PDF)

59. M. Spencer, B. Bordalejo, L.-S. Wang, A. C. Barbrook, L. R. Mooney, P. Robinson, T. Warnow and C. J. Howe. 2003. "Gene Order Analysis Reveals the History of The Canterbury Tales Manuscripts." Computers and the Humanities, 37 (1): 97-109. Feb. 2003. Kluwer Academic Pub.

60. G. Ganapathy, V. Ramachandran, and T. Warnow. 2003. "Better Hill-Climbing Seaches for Parsimony." In Proceedings of the Third International Workshop on Algorithms in Bioinformatics (WABI 2003), pages 245--258, 2003.

61. K. St. John, T. Warnow, B.M.E. Moret, and L. Vawter. 2003. "Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining". J. of Algorithms, 48, 1 (2003), 173-193. Special issue on the best papers from SODA 2001. (PDF)

62. U. Roshan, B. M. E. Moret, T. L. Williams, and T. Warnow. 2004. "Performance of supertree methods on various dataset decompositions". In O. R. P. Bininda-Emonds, editor, Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, Volume 3 of Computational Biology, pages 301-328, Kluwer Academics, 2004 (Andreas Dress, series editor). (PS)

63. G. Ganapathy, V. Ramachandran, and T. Warnow. 2004. "On Contract-and-Refine-Transformations Between Phylogenetic Trees." In Proceedings of the Fifteenth ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004. (SODA 2004.)

64. L. Nakhleh, T. Warnow, and C. R. Linder 2004. "Reconstructing reticulate evolution in species - theory and practice." Proceedings of the Eighth Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004), pp 337-346. (Also submitted, by special invitation, to the Journal of Computational Biology, for selected papers from RECOMB 2004.) (J. Computational Biology and RECOMB 2004)

65. U. Roshan, B.M.E. Moret, T.L. Williams, and T. Warnow, "Rec-I-DCM3: A fast algorithmic technique for reconstructing large phylogenetic trees," Proc. IEEE Computer Society Bioinformatics Conference CSB 2004, Stanford U., 2004. (PDF)

66. B.M.E. Moret, L. Nakhleh, T. Warnow, C.R. Linder, A. Tholse, A. Padolina, J. Sun, and R. Timme, "Phylogenetic networks: modeling, reconstructibility, and accuracy," IEEE/ACM Transactions on Computational Biology and Biocomputing, 1(1):13-23, 2004. (PDF)

67. S.N. Evans, and Tandy Warnow, "Unidentifiable divergence times in rates-across-sites models." IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1, pp. 130-134. 2005. (PDF)

68. L.-S. Wang and T. Warnow. "Distance-based genome rearrangement phylogeny." In Mathematics of Evolution and Phylogeny, O. Gascuel, ed., Oxford Univ. Press, 2005. (PDF)

69. B.M.E. Moret, J. Tang, and T. Warnow. "Reconstructing phylogenies from gene-content and gene-order data." In Mathematics of Evolution and Phylogeny, pp. 321-352, O. Gascuel, ed., Oxford Univ. Press. (PDF)

70. B.M.E. Moret and T. Warnow, "Advances in phylogeny reconstruction from gene order and content data," in Molecular Evolution: Producing the Biochemical Data, Part B, E.A. Zimmer and E.H. Roalson, eds., Vol. 395 of Methods in Enzymology, Elsevier (to appear April 2005). (PDF)

71. L. Nakhleh, D. Ringe, and T. Warnow, "Perfect Phylogenetic Networks: A New Methodology for Reconstructing the Evolutionary History of Natural Languages." Language (Journal of the Linguistic Society of America), 81(2):382-420, 2005. (PDF)

72. L. Nakhleh, T. Warnow, C. R. Linder, and K. St. John. 2005. "Reconstructing reticulate evolution in species - theory and practice." The Journal of Computational Biology, 12(6-7), 796-811, 2005; special issue for selected papers from RECOMB 2004. (PDF)

73. L. Nakhleh, T. Warnow, D. Ringe, and S.N. Evans, "A Comparison of Phylogenetic Reconstruction Methods on an IE Dataset." The Transactions of the Philological Society, 103(2): 171-192, 2005. (PDF)

74. G. Ganapathy, G., B. Goodson, R. Jansen, V. Ramachandran, and T. Warnow, 2005. "Pattern identification in biogeography: metrics and algorithms for comparing area cladograms." Proceedings of the Fifth International Workshop on Algorithms for Bioinformatics (WABI), pp. 116-127, 2005. (PDF).

75. T. Warnow, 2005. "Large-scale phylogenetic reconstruction." Book chapter, in S. Aluru (editor), Handbook of Computational Biology, Chapman & Hall, CRC Computer and Information Science Series, 2005. (PDF)

76. C.R. Linder, and T. Warnow, 2005. "Overview of phylogeny reconstruction." Book chapter, in S. Aluru (editor), Handbook of Computational Biology, Chapman & Hall, CRC Computer and Information Science Series, 2005. (PDF)

77. S.N. Evans, Don Ringe, and Tandy Warnow, "Inference of divergence times as a statistical inverse problem." Invited paper, Phylogenetic Methods and the Prehistory of Languages, MacDonald Institute Press, University of Cambridge (PDF), 2006.

78. T. Warnow, S.N. Evans, D. Ringe, and L. Nakhleh, "A stochastic model of language evolution that incorporates homoplasy and borrowing." Invited paper, Phylogenetic Methods and the Prehistory of Languages, MacDonald Institute Press, University of Cambridge (PDF), 2006.

79. L.-S. Wang and T. Warnow, 2006. "Reconstructing Chromosomal Evolution." SIAM J. Computing, Vol. 36, Issue 2, 99-131, 2006.

80. L.-S. Wang, T. Warnow, B.M.E. Moret, R.K. Jansen, and L.A. Raubeson, 2006. "Distance-based Genome Rearrangement Phylogeny." Journal of Molecular Evolution, 63(4):473-83, 2006.

81. G. Ganapathy, Goodson B., Jansen R., Le H., Ramachandran, V., and Warnow, T., "Pattern Identification in Biogeography". IEEE/ACM Transactions on Computational Biology and Bioinformatics, (IEEE-TCBB), Vol 3, No. 4, pp. 334-346, 2006

82. J.H. Leebens-Mack, T. Vision, E. Brenner, J.E. Bowers, S. Cannon, M.J. Clement, C.W. Cunningham, C. dePamphilis, R. Desalle, J.J. Doyle, J.A. Eisen, X. Gu, J. Harshman, R.K. Jansen, E.A. Kellogg, E.V. Koonin, B.D. Mishler, H. Philippe, J.C. Pires, Y-L. Qiu, S.Y. Rhee, K. Sjolander, D.E. Soltis, P.S. Soltis, D.W. Stevenson, K. Wall, T. Warnow, C. Zmasek. 2006. "Taking the First Steps towards a Standard for Reporting on Phylogenies: Minimum Information about a Phylogenetic Analysis (MIAPA)." OMICS 10(2):231-237, 2006.

83. Nelesen, S., K. Liu, D. Zhao, R. Linder, and T. Warnow, 2008. "The effect of the guide tree on multiple sequence alignment and subsequent phylogenetic analyses", Proceedings of the 2008 Pacific Symposium on Biocomputing (PSB 2008), pages 25-36.

84. S. Snir, T. Warnow and S. Rao, "Short Quartet Puzzling: A New Quartet-based Phylogeny Reconstruction Algorithm". Journal of Computational Biology, Vol. 15, No. 1, January 2008, pp. 91-103.

85. D. Ringe and T. Warnow. "Linguistic History and Computational Cladistics", book chapter in Origin and Evolution of Languages: Approaches, Models, Paradigms. Edited by Bernard Laks. Equinox Publishing. March, 2008.

86. Nichols, J. and T. Warnow, 2008. "Tutorial on computational linguistic phylogeny." Linguistics and Language Compass, Vol. 2, Issue 5, September 2008, pages 760-820.

88. Liu, K., S. Raghavan, S. Nelesen, C. R. Linder, T. Warnow, 2009. "Rapid and accurate largescale coestimation of sequence alignments and phylogenetic trees." Science, vol. 324, no. 5934, pp. 1561-1564, 19 June 2009, doi: 10.1126/science.1171243. (Corresponding author)

89. Swenson, M.S., F. Barbancon, R. Linder, and T. Warnow. "A simulation study comparing supertree and combined analysis methods using SMIDGen." Proceedings of WABI (Workshop on Algorithms for Bioinformatics) 2009.

90. Bradner, J.E., N. West, M.L. Grachan, E. Greenberg, S.J. Haggarty, T. Warnow and R. Mazitschek. "Chemical phylogenetics of histone deacetylases", 2010. Nature Chemical Biology, 6, pp. 238-243; published online 7 February 2010.

91. Swenson, M.S., F. Barbancon, C.R. Linder, and T. Warnow. "A simulation study comparing supertree and combined analysis methods using SMIDGen." Algorithms for Molecular Biology, 5:8 (4 January 2010), special issue of selected papers from WABI 2009.

92. Swenson, M.S., R. Suri, C.R. Linder and T. Warnow. "An experimental study of Quartets MaxCut and other supertree methods." Proceedings of Workshop on Algorithms for Bioinformatics (WABI 2010) 2010.

93. Linder, C.R., R. Suri, K. Liu, and T. Warnow. "Benchmark datasets and software for developing and testing methods for large-scale multiple sequence alignment and phylogenetic inference." PLoS Currents: Tree of Life, 2010 Nov 18 doi: 10.1371/currents.RRN1195.

94. Liu, K., C.R. Linder, and T. Warnow. "Multiple sequence alignment: a major challenge for large-scale phylogenetics." PLoS Currents: Tree of Life, 2010 Nov 18 doi:10.1371/currents.RRN1198.

95. Swenson, M.S., R. Suri, C.R. Linder, and T. Warnow. "An experimental study of Quartets MaxCut and other supertree methods." Journal of Algorithms for Molecular Biology 2011, 6(7), special issue of selected papers from WABI 2010.

96. Wang, L., J. Leebens-Mack, P.K. Wall, K. Beckmann, C.W. dePamphilis, and T. Warnow. "The impact of multiple protein sequence alignment on phylogenetic estimation." IEEE Transactions on Computational Biology and Bioinformatics (IEEE-TCBB), Vol 8, pp. 1108-1119, 2011.

97. Yu, Y., T. Warnow, and L. Nakhleh. "Algorithms for MDC-based Multi-locus Phylogeny Inference." Proceedings of RECOMB 2011 (PDF). The full paper has additional results: ``Algorithms for MDC-Based Multi-Locus Phylogeny Inference: Beyond Rooted Binary Gene Trees on Single Alleles," J. Computational Biology November 2011, Vol. 18, No. 11, pp 1543-1559.

98. Yang, J. and T. Warnow "Fast and accurate methods for phylogenomic analyses." RECOMB Comparative Genomics 2011, and BMC Bioinformatics 12(Suppl 9): S4 (5 October 2011).

99. Mirarab, S. and T. Warnow. "FastSP: Linear-time calculation of alignment accuracy." Bioinformatics (2011) 27(23):3250-3258.

100. Liu, K., C. Randal Linder, and T. Warnow. "RAxML and FastTree: Comparing Two Methods for Large-Scale Maximum Likelihood Phylogeny Estimation" 2012. PLoS ONE 6(11): e27731. doi:10.1371/journal.pone.0027731

101. Liu, K., T.J. Warnow, M.T. Holder, S. Nelesen, J. Yu, A. Stamatakis, and C.R. Linder. "SATe-II: Very Fast and Accurate Simultaneous Estimation of Multiple Sequence Alignments and Phylogenetic Trees." Systematic Biology (2012) 61(1):90-106.

102. Swenson, M.S., R. Suri, C.R. Linder, and T. Warnow. "SuperFine: fast and accurate supertree estimation." Systematic Biology (2012) 61(2):214-227.

103. Mirarab, S., N. Nguyen, and T. Warnow. "SEPP: SATe-Enabled Phylogenetic Placement." Proceedings of the 2012 Pacific Symposium on Biocomputing (PSB 2012).

104. Neves, D. T., T. Warnow, J. L. Sobral and K. Pingali. ``Parallelizing SuperFine." 27th Symposium on Applied Computing (ACM-SAC), Bioinformatics, 2012, pages 1361--1367, doi = 10.1145/2231936.2231992.

105. Bayzid, Md. S. and T. Warnow. "Estimating Optimal Species Trees from Incomplete Gene Trees under Deep Coalescence." Journal of Computational Biology, June 2012, Vol. 19, No. 6: 591-605, special issue for Simon Tavare and Michael Waterman. (HTML).

106. Nguyen, N., S. Mirarab, and T. Warnow. "MRL and SuperFine+MRL: new supertree methods." Journal Algorithms for Molecular Biology 7:3, 2012.

107. Liu, K. and T. Warnow. "Treelength optimization for phylogeny estimation." PLoS One, 7(3):e33104. doi:10.1371/journal.pone.0033104, 2012.

108. T. Warnow. "Standard maximum likelihood analyses of alignments with gaps can be statistically inconsistent." PLoS Currents: Tree of Life, 2012 March 12 doi:10.1371/currents.RRN1308. See also PMC.

109. Nelesen, S., K. Liu, L.-S. Wang, C. R. Linder, and T. Warnow. "DACTAL: divide-and-conquer trees (almost) without alignments." Bioinformatics Vol 28, ISMB 2012, pages i274-i282.

110. F. Barbancon, S. Evans, L. Nakhleh, D. Ringe, and T. Warnow. "An experimental study comparing linguistic phylogenetic reconstruction methods." Diachronica, 2013, 30(2):143-170, with supplementary materials. A preliminary version of this was presented at the conference Languages and Genes, organized by Bernard Comrie and held at UC Santa Barbara in 2007; this version is available as Technical Report 732, Department of Statistics, University of California at Berkeley.

111. M.S. Bayzid, S. Mirarab, and T. Warnow. "Inferring optimal species trees under gene duplication and loss." Pacific Symposium on Biocomputing, 18:250-261 (2013). (PDF).

112. M.S. Bayzid and T. Warnow. "Naive binning improves phylogenomic analyses". Bioinformatics, supplementary materials.

113. T. Warnow. "Large-scale multiple sequence alignment and phylogeny estimation" Chapter 6 in "Models and Algorithms for Genome Evolution", edited by Cedric Chauve, Nadia El-Mabrouk and Eric Tannier, Springer series on "Computational Biology". For a preprint (not in final form) of this chapter, see this PDF,

114. S. Mirarab, N. Nguyen, and T. Warnow. "PASTA: ultra-large multiple sequence alignment". Proceedings RECOMB 2014 (PDF). Supplementary materials at figshare -- (PDF) Extended version submitted to the Journal of Computational Biology.

115. S. Mirarab, R. Reaz, Md. S. Bayzid, T. Zimmermann, M.S. Swenson, and T. Warnow. "ASTRAL: Genome-Scale Coalescent-Based Species Tree Estimation." Proceedings, ECCB (European Conference on Computational Biology), 2014.

116. Md S. Bayzid, T. Hunt, and T. Warnow. ``Disk Covering Methods Improve Phylogenomic Analyses". To appear, Proceedings of RECOMB-CG (Comparative Genomics), 2014, and BMC Genomics.

117. T. Zimmermann, S. Mirarab and T. Warnow. ``BBCA: Improving the scalability of *BEAST using random binning". To appear, Proceedings of RECOMB-CG (Comparative Genomics), 2014, and BMC Genomics.

118. S. Mirarab, Md S. Bayzid, and T. Warnow. ``Evaluating summary methods for multi-locus species tree estimation in the presence of incomplete lineage sorting". To appear, Systematic Biology.