Tandy J. Warnow

SODA Conference 2004 Conference Paper

On contract-and-refine transformations between phylogenetic trees

• Ganeshkumar Ganapathy
• Vijaya Ramachandran
• Tandy J. Warnow

SODA Conference 2001 Conference Paper

Absolute convergence: true trees from short sequences

• Tandy J. Warnow
• Bernard M. E. Moret
• Katherine St. John

STOC Conference 2001 Conference Paper

Estimating true evolutionary distances between genomes

• Li-San Wang
• Tandy J. Warnow

SODA Conference 2001 Conference Paper

Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining

• Katherine St. John
• Tandy J. Warnow
• Bernard M. E. Moret
• Lisa Vawter

TCS Journal 2000 Journal Article

The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs

• Hans L. Bodlaender
• Michael R. Fellows
• Michael T. Hallett
• H.Todd Wareham
• Tandy J. Warnow

TCS Journal 1999 Journal Article

A few logs suffice to build (almost) all trees: Part II

• Péter L. Erdös
• Michael A. Steel
• LászlóA. Székely
• Tandy J. Warnow

SODA Conference 1996 Conference Paper

Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology

• Monika Henzinger
• Valerie King
• Tandy J. Warnow

STOC Conference 1996 Conference Paper

Constructing Evolutionary Trees in the Presence of Polymorphic Characters

• Maria Luisa Bonet
• Cynthia A. Phillips
• Tandy J. Warnow
• Shibu Yooseph

SODA Conference 1996 Conference Paper

Reconstructing the Evolutionary History of Natural Languages

• Tandy J. Warnow
• Donald Ringe
• Ann Taylor

SODA Conference 1995 Conference Paper

A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed

• Sampath Kannan
• Tandy J. Warnow

SODA Conference 1995 Conference Paper

Computing the Local Consensus of Trees

• Sampath Kannan
• Tandy J. Warnow
• Shibu Yooseph

STOC Conference 1993 Conference Paper

A robust model for finding optimal evolutionary trees

• Martín Farach-Colton
• Sampath Kannan
• Tandy J. Warnow

SODA Conference 1993 Conference Paper

Tree Compatibility and Inferring Evoluationary History

• Tandy J. Warnow

SODA Conference 1993 Conference Paper

Triangulating Vertex Colored Graphs

• Fred R. McMorris
• Tandy J. Warnow
• Thomas Wimer

SODA Conference 1991 Conference Paper

Triangulating Three-Colored Graphs

• Sampath Kannan
• Tandy J. Warnow

SODA Conference 1990 Conference Paper

Determining the Evolutionary Tree

• Sampath Kannan
• Eugene L. Lawler
• Tandy J. Warnow

FOCS Conference 1990 Conference Paper

Inferring Evolutionary History from DNA Sequences (Extended Abstract)

• Sampath Kannan
• Tandy J. Warnow

Two related problems are considered. The first is determining whether it is possible to triangulate a vertex-colored graph without introducing edges between vertices of the same color. This is related to a fundamental problem for geneticists, that of using character state information to construct evolutionary trees. The polynomial equivalence of these problems is demonstrated. An important subproblem arises when the characters are based on DNA sequences. Such characters assume up to four states. An O(n/sup 2/k) algorithm, where n is the number of species and k is the number of characters, is presented for this case. >