| 2009 | ||
|---|---|---|
| 85 | Steven Salzberg, Tandy Warnow: Algorithms in Bioinformatics, 9th International Workshop, WABI 2009, Philadelphia, PA, USA, September 12-13, 2009. Proceedings Springer 2009 | |
| 84 | M. Shel Swenson, François Barbançon, C. Randal Linder, Tandy Warnow: A Simulation Study Comparing Supertree and Combined Analysis Methods Using SMIDGen. WABI 2009: 333-344 | |
| 83 | Kevin Liu, Serita M. Nelesen, Sindhu Raghavan, C. Randal Linder, Tandy Warnow: Barking Up The Wrong Treelength: The Impact of Gap Penalty on Alignment and Tree Accuracy. IEEE/ACM Trans. Comput. Biology Bioinform. 6(1): 7-21 (2009) | |
| 2008 | ||
| 82 | Michael Brudno, Bernard M. E. Moret, C. Randal Linder, Tandy Warnow: Session Introduction. Pacific Symposium on Biocomputing 2008: 1-2 | |
| 81 | Serita M. Nelesen, Kevin Liu, D. Zhao, C. Randal Linder, Tandy Warnow: The Effect of the Guide Tree on Multiple Sequence Alignments and Subsequent Phylogenetic Analysis. Pacific Symposium on Biocomputing 2008: 25-36 | |
| 80 | Sagi Snir, Tandy Warnow, Satish Rao: Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm. Journal of Computational Biology 15(1): 91-103 (2008) | |
| 2006 | ||
| 79 | Ganeshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Hai-son Le, Vijaya Ramachandran, Tandy Warnow: Pattern Identification in Biogeography. IEEE/ACM Trans. Comput. Biology Bioinform. 3(4): 334-346 (2006) | |
| 78 | Li-San Wang, Tandy Warnow: Reconstructing Chromosomal Evolution. SIAM J. Comput. 36(1): 99-131 (2006) | |
| 2005 | ||
| 77 | Ganeshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Vijaya Ramachandran, Tandy Warnow: Pattern Identification in Biogeography. WABI 2005: 116-127 | |
| 76 | Luay Nakhleh, Tandy Warnow, C. Randal Linder, Katherine St. John: Reconstructing Reticulate Evolution in SpeciesTheory and Practice. Journal of Computational Biology 12(6): 796-811 (2005) | |
| 2004 | ||
| 75 | Usman Roshan, Bernard M. E. Moret, Tandy Warnow, Tiffani L. Williams: Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees. CSB 2004: 98-109 | |
| 74 | Luay Nakhleh, Tandy Warnow, C. Randal Linder: Reconstructing reticulate evolution in species: theory and practice. RECOMB 2004: 337-346 | |
| 73 | Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy Warnow: On contract-and-refine transformations between phylogenetic trees. SODA 2004: 900-909 | |
| 72 | Bernard M. E. Moret, Luay Nakhleh, Tandy Warnow, C. Randal Linder, Anna Tholse, Anneke Padolina, Jerry Sun, Ruth E. Timme: Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy. IEEE/ACM Trans. Comput. Biology Bioinform. 1(1): 13-23 (2004) | |
| 71 | Steven N. Evans, Tandy Warnow: Unidentifiable Divergence Times in Rates-across-Sites Models. IEEE/ACM Trans. Comput. Biology Bioinform. 1(3): 130-134 (2004) | |
| 70 | Tandy Warnow, Binhai Zhu: Preface. Theor. Comput. Sci. 325(3): 345-346 (2004) | |
| 2003 | ||
| 69 | Tandy Warnow, Binhai Zhu: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings Springer 2003 | |
| 68 | Luay Nakhleh, Jerry Sun, Tandy Warnow, C. Randal Linder, Bernard M. E. Moret, Anna Tholse: Towards the Development of Computational Tools for Evaluating Phylogenetic Network Reconstruction Methods. Pacific Symposium on Biocomputing 2003: 315-326 | |
| 67 | Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy Warnow: Better Hill-Climbing Searches for Parsimony. WABI 2003: 245-258 | |
| 66 | Katherine St. John, Tandy Warnow, Bernard M. E. Moret, Lisa Vawter: Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. J. Algorithms 48(1): 173-193 (2003) | |
| 2002 | ||
| 65 | Ganeshkumar Ganapathy, Tandy Warnow: Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees. APPROX 2002: 122-134 | |
| 64 | Cara Stockham, Li-San Wang, Tandy Warnow: Statistically based postprocessing of phylogenetic analysis by clustering. ISMB 2002: 285-293 | |
| 63 | Luay Nakhleh, Bernard M. E. Moret, Usman Roshan, Katherine St. John, Jerry Sun, Tandy Warnow: The Accuracy of Fast Phylogenetic Methods for Large Datasets. Pacific Symposium on Biocomputing 2002: 211-222 | |
| 62 | Li-San Wang, Robert K. Jansen, Bernard M. E. Moret, Linda A. Raubeson, Tandy Warnow: Fast Phylogenetic Methods for the Analysis of Genome Rearrangement Data: An Empirical Study. Pacific Symposium on Biocomputing 2002: 524-535 | |
| 61 | Luay Nakhleh, Usman Roshan, Lisa Vawter, Tandy Warnow: Estimating the Deviation from a Molecular Clock. WABI 2002: 287-299 | |
| 60 | Bernard M. E. Moret, Usman Roshan, Tandy Warnow: Sequence-Length Requirements for Phylogenetic Methods. WABI 2002: 343-356 | |
| 59 | Bernard M. E. Moret, Li-San Wang, Tandy Warnow: Toward New Software for Computational Phylogenetics. IEEE Computer 35(7): 55-64 (2002) | |
| 58 | Bernard M. E. Moret, Jijun Tang, Li-San Wang, Tandy Warnow: Steps toward accurate reconstructions of phylogenies from gene-order data. J. Comput. Syst. Sci. 65(3): 508-525 (2002) | |
| 57 | Bernard M. E. Moret, David A. Bader, Tandy Warnow: High-Performance Algorithm Engineering for Computational Phylogenetics. The Journal of Supercomputing 22(1): 99-111 (2002) | |
| 2001 | ||
| 56 | Bernard M. E. Moret, Li-San Wang, Tandy Warnow, Stacia K. Wyman: New approaches for reconstructing phylogenies from gene order data. ISMB (Supplement of Bioinformatics) 2001: 165-173 | |
| 55 | Luay Nakhleh, Usman Roshan, Katherine St. John, Jerry Sun, Tandy Warnow: Designing fast converging phylogenetic methods. ISMB (Supplement of Bioinformatics) 2001: 190-198 | |
| 54 | Bernard M. E. Moret, David A. Bader, Tandy Warnow: High-Performance Algorithm Engineering for Computational Phylogenetics. International Conference on Computational Science (2) 2001: 1012-1021 | |
| 53 | Bernard M. E. Moret, Stacia K. Wyman, David A. Bader, Tandy Warnow, Mi Yan: A New Implmentation and Detailed Study of Breakpoint Analysis. Pacific Symposium on Biocomputing 2001: 583-594 | |
| 52 | Tandy Warnow, Bernard M. E. Moret, Katherine St. John: Absolute convergence: true trees from short sequences. SODA 2001: 186-195 | |
| 51 | Katherine St. John, Tandy Warnow, Bernard M. E. Moret, Lisa Vawter: Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. SODA 2001: 196-205 | |
| 50 | Li-San Wang, Tandy Warnow: Estimating true evolutionary distances between genomes. STOC 2001: 637-646 | |
| 49 | Ganeshkumar Ganapathysaravanabavan, Tandy Warnow: Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time. WABI 2001: 156-163 | |
| 48 | Luay Nakhleh, Usman Roshan, Katherine St. John, Jerry Sun, Tandy Warnow: The Performance of Phylogenetic Methods on Trees of Bounded Diameter. WABI 2001: 214-226 | |
| 2000 | ||
| 47 | Bernard M. E. Moret, Tandy Warnow: Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics. Experimental Algorithmics 2000: 163-180 | |
| 46 | Mary E. Cosner, Robert K. Jansen, Bernard M. E. Moret, Linda A. Raubeson, Li-San Wang, Tandy Warnow, Stacia K. Wyman: A New Fast Heuristic for Computing the Breakpoint Phylogeny and Experimental Phylogenetic Analyses of Real and Synthetic Data. ISMB 2000: 104-115 | |
| 45 | Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy Warnow: The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theor. Comput. Sci. 244(1-2): 167-188 (2000) | |
| 1999 | ||
| 44 | Daniel H. Huson, Kelly Ann Smith, Tandy Warnow: Estimating Large Distances in Phylogenetic Reconstruction. Algorithm Engineering 1999: 272-286 | |
| 43 | Daniel H. Huson, Lisa Vawter, Tandy Warnow: Solving Large Scale Phylogenetic Problems using DCM2. ISMB 1999: 118-129 | |
| 42 | Daniel H. Huson, Scott Nettles, Tandy Warnow: Obtaining highly accurate topology estimates of evolutionary trees from very short sequences. RECOMB 1999: 198-207 | |
| 41 | Daniel H. Huson, Scott Nettles, Kenneth Rice, Tandy Warnow, Shibu Yooseph: Hybrid Tree Reconstruction Methods. ACM Journal of Experimental Algorithmics 4: 5 (1999) | |
| 40 | Monika Rauch Henzinger, Valerie King, Tandy Warnow: Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. Algorithmica 24(1): 1-13 (1999) | |
| 39 | Daniel H. Huson, Scott Nettles, Tandy Warnow: Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction. Journal of Computational Biology 6(3/4): (1999) | |
| 38 | Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow: A few logs suffice to build (almost) all trees (I). Random Struct. Algorithms 14(2): 153-184 (1999) | |
| 37 | Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warnow, Shibu Yooseph: Constructing Evolutionary Trees in the Presence of Polymorphic Characters. SIAM J. Comput. 29(1): 103-131 (1999) | |
| 36 | Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow: A Few Logs Suffice to Build (almost) All Trees: Part II. Theor. Comput. Sci. 221(1-2): 77-118 (1999) | |
| 1998 | ||
| 35 | Daniel H. Huson, Scott Nettles, Kenneth Rice, Tandy Warnow, Shibu Yooseph: Hybrid Tree Reconstruction Methods. Algorithm Engineering 1998: 179-192 | |
| 34 | Maria Luisa Bonet, Mike A. Steel, Tandy Warnow, Shibu Yooseph: Better methods for solving parsimony and compatibility. RECOMB 1998: 40-49 | |
| 33 | Maria Luisa Bonet, Mike A. Steel, Tandy Warnow, Shibu Yooseph: Better Methods for Solving Parsimony and Compatibility. Journal of Computational Biology 5(3): 391-408 (1998) | |
| 32 | Sampath Kannan, Tandy Warnow: Computing the Local Consensus of Trees. SIAM J. Comput. 27(6): 1695-1724 (1998) | |
| 1997 | ||
| 31 | Kenneth Rice, Tandy Warnow: Parsimony is Hard to Beat. COCOON 1997: 124-133 | |
| 30 | Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy Warnow: Constructing Big Trees from Short Sequences. ICALP 1997: 827-837 | |
| 29 | Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy Warnow: Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule. Computers and Artificial Intelligence 16(2): (1997) | |
| 28 | Sampath Kannan, Tandy Warnow: A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies. SIAM J. Comput. 26(6): 1749-1763 (1997) | |
| 1996 | ||
| 27 | Cynthia A. Phillips, Tandy Warnow: The Asymmetric Median Tree - A New model for Building Consensus Trees. CPM 1996: 234-252 | |
| 26 | Tandy Warnow, Donald Ringe, Ann Taylor: Reconstructing the Evolutionary History of Natural Languages. SODA 1996: 314-322 | |
| 25 | Monika Rauch Henzinger, Valerie King, Tandy Warnow: Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. SODA 1996: 333-340 | |
| 24 | Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warnow, Shibu Yooseph: Constructing Evolutionary Trees in the Presence of Polymorphic Characters. STOC 1996: 220-229 | |
| 23 | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow: Minimizing Phylogenetic Number To Find Good Evolutionary Trees. Discrete Applied Mathematics 71(1-3): 111-136 (1996) | |
| 22 | Cynthia A. Phillips, Tandy Warnow: The Asymmetric Median Tree - A New Model for Building Consensus Trees. Discrete Applied Mathematics 71(1-3): 311-335 (1996) | |
| 21 | Sampath Kannan, Eugene L. Lawler, Tandy Warnow: Determining the Evolutionary Tree Using Experiments. J. Algorithms 21(1): 26-50 (1996) | |
| 1995 | ||
| 20 | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow: Minimizing Phylogenetic Number to find Good Evolutionary Trees. CPM 1995: 102-127 | |
| 19 | Craig J. Benham, Sampath Kannan, Tandy Warnow: Of Chicken Teeth and Mouse Eyes, or Generalized Character Compatibility. CPM 1995: 17-26 | |
| 18 | Sampath Kannan, Tandy Warnow: A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed. SODA 1995: 595-603 | |
| 17 | Sampath Kannan, Tandy Warnow, Shibu Yooseph: Computing the Local Consensus of Trees. SODA 1995: 68-77 | |
| 16 | Martin Farach, Sampath Kannan, Tandy Warnow: A Robust Model for Finding Optimal Evolutionary Trees. Algorithmica 13(1/2): 155-179 (1995) | |
| 15 | Craig J. Benham, Sampath Kannan, Michael Paterson, Tandy Warnow: Hen's Teeth and Whale's Feet: Generalized Characters and Their Compatibility. Journal of Computational Biology 2(4): 515-525 (1995) | |
| 14 | Sampath Kannan, Tandy Warnow: Tree Reconstruction from Partial Orders. SIAM J. Comput. 24(3): 511-519 (1995) | |
| 1994 | ||
| 13 | Tandy Warnow: Tree Compatibility and Inferring Evolutionary History. J. Algorithms 16(3): 388-407 (1994) | |
| 12 | Sampath Kannan, Tandy Warnow: Inferring Evolutionary History from DNA Sequences. SIAM J. Comput. 23(4): 713-737 (1994) | |
| 11 | Fred R. McMorris, Tandy Warnow, Thomas Wimer: Triangulating Vertex-Colored Graphs. SIAM J. Discrete Math. 7(2): 296-306 (1994) | |
| 1993 | ||
| 10 | Fred R. McMorris, Tandy Warnow, Thomas Wimer: Triangulating Vertex Colored Graphs. SODA 1993: 120-127 | |
| 9 | Tandy Warnow: Tree Compatibility and Inferring Evoluationary History. SODA 1993: 382-391 | |
| 8 | Martin Farach, Sampath Kannan, Tandy Warnow: A robust model for finding optimal evolutionary trees. STOC 1993: 137-145 | |
| 7 | Sampath Kannan, Tandy Warnow: Tree Reconstruction from Partial Orders. WADS 1993: 397-408 | |
| 6 | Mike A. Steel, Tandy Warnow: Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree. Inf. Process. Lett. 48(2): 77-82 (1993) | |
| 1992 | ||
| 5 | Hans L. Bodlaender, Michael R. Fellows, Tandy Warnow: Two Strikes Against Perfect Phylogeny. ICALP 1992: 273-283 | |
| 4 | Sampath Kannan, Tandy Warnow: Triangulating 3-Colored Graphs. SIAM J. Discrete Math. 5(2): 249-258 (1992) | |
| 1991 | ||
| 3 | Sampath Kannan, Tandy Warnow: Triangulating Three-Colored Graphs. SODA 1991: 337-343 | |
| 1990 | ||
| 2 | Sampath Kannan, Tandy Warnow: Inferring Evolutionary History from DNA Sequences (Extended Abstract) FOCS 1990: 362-371 | |
| 1 | Sampath Kannan, Eugene L. Lawler, Tandy Warnow: Determining the Evolutionary Tree. SODA 1990: 475-484 | |