If you made any changes in Pure, your changes will be visible here soon.

Research Output 1990 2019

1990

Determining the evolutionary tree

Kannan, S., Lawler, E. & Warnow, T., Jan 1 1990, Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990. Association for Computing Machinery, p. 475-484 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evolutionary Tree
1991

Inferring evolutionary history from DNA sequences

Kannan, S. & Warnow, T., Jan 1 1991, In : IEEE Transactions on Industry Applications. 27, 1 pt 1, p. 362-371 10 p.

Research output: Contribution to journalConference article

DNA sequences
Polynomials
Color

Triangulating three-colored graphs

Kannan, S. K. & Warnow, T. J., 1991, Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1991). ACM, New York, p. 337-343 7 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Triangulating three-colored graphs

Kannan, S. K. & Warnow, T., Mar 1 1991, Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Association for Computing Machinery, p. 337-343 7 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Colored Graph
Taxonomies
Color
Numerical Taxonomy
Partial K-tree
1992

Triangulating $3$-colored graphs

Kannan, S. K. & Warnow, T. J., 1992, In : SIAM Journal on Discrete Mathematics. 5, 2, p. 249-258 10 p.

Research output: Contribution to journalArticle

Two strikes against perfect phylogeny

Bodlaender, H. L., Fellows, M. R. & Warnow, T. J., Jan 1 1992, Automata, Languages and Programming - 19th International Colloquium, Proceedings. Kuich, W. (ed.). Springer-Verlag, p. 273-283 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 623 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Phylogeny
Bounded Treewidth
Molecular biology
Computational complexity
Open Problems

Two strikes against perfect phylogeny

Bodlaender, H. L., Fellows, M. R. & Warnow, T. J., 1992, Automata, languages and programming (Vienna, 1992). Springer Berlin, Vol. 623. p. 273-283 11 p. (Lecture Notes in Comput. Sci.).

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

1993

A robust model for finding optimal evolutionary trees extended abstract

Farach, M., Kannan, S. & Warnow, T., Jun 1 1993, Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Association for Computing Machinery, p. 137-145 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129585).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Polynomials
Computational complexity

Constructing phylogenetic trees efficiently using compatibility criteria

Warnow, T., Jul 1 1993, In : New Zealand Journal of Botany. 31, 3, p. 239-248 10 p.

Research output: Contribution to journalArticle

bioinformatics
phylogenetics
phylogeny

Engineering in Genomics Combinatorial Optimization in Biology

Warnow, T., Jun 1993, In : IEEE Engineering in Medicine and Biology Magazine. 12, 2, p. 91-92 2 p.

Research output: Contribution to journalArticle

Combinatorial optimization
Genomics

Kaikoura tree theorems: Computing the maximum agreement subtree

Steel, M. & Warnow, T., Nov 8 1993, In : Information Processing Letters. 48, 2, p. 77-82 6 p.

Research output: Contribution to journalArticle

Computing
Theorem
Binary trees
Leaves
Binary Tree

Tree compatibility and inferring evolutionary history

Warnow, T., Jan 1 1993, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Publ by ACM, p. 382-391 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Trees (mathematics)
Labeling
Amino acids
Polynomials
Phylogeny

Tree reconstruction from partial orders

Kannan, S. & Warnow, T., Jan 1 1993, Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. Dehne, F., Sack, J-R., Santoro, N. & Whitesides, S. (eds.). Springer-Verlag, p. 397-408 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 709 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Partial Order
Distance Matrix
Linguistics
Computational complexity
NP-complete problem

Triangulating vertex colored graphs

McMorris, F. R., Warnow, T. & Wimer, T., 1993, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Publ by ACM, p. 120-127 8 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Color
Dynamic programming
Phylogeny
1994

Inferring evolutionary history from DNA sequences

Kannan, S. K. & Warnow, T., Jan 1 1994, In : SIAM Journal on Computing. 23, 4, p. 713-737 25 p.

Research output: Contribution to journalArticle

DNA sequences
DNA Sequence
Molecular biology
Phylogenetic Tree
Compatibility

In Memoriam Eugene L. Lawler

Gustfield, D., Shmoys, D., Lenstra, J. K. & Warnow, T., 1994, In : Journal of Computational Biology. 1, 4, p. 255-256 2 p.

Research output: Contribution to journalArticle

Tree compatibility and inferring evolutionary history

Warnow, T., May 1994, In : Journal of Algorithms. 16, 3, p. 388-407 20 p.

Research output: Contribution to journalArticle

Compatibility
Phylogeny
Labeled Trees
Trees (mathematics)
History
1995

A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed

Kannan, S. & Warnow, T., 1995, Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1995). ACM, New York, p. 595-603 9 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed

Kannan, S. & Warnow, T., Jan 22 1995, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Association for Computing Machinery, p. 595-603 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Phylogeny
Enumeration
Fast Algorithm
Polynomials
Biology

A robust model for finding optimal evolutionary trees

Farach, M., Kannan, S. & Warnow, T., Feb 1 1995, In : Algorithmica. 13, 1-2, p. 155-179 25 p.

Research output: Contribution to journalArticle

Evolutionary Tree
Distance Matrix
Model
Polynomial-time Algorithm
Upper and Lower Bounds

Computing the local consensus of trees

Kannan, S., Warnow, T. & Yooseph, S., Jan 22 1995, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Association for Computing Machinery, p. 68-77 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Computing
Linguistics
Polynomials
Evolutionary Tree
Tie

Hen's Teeth and Whale's Feet: Generalized Characters and Their Compatibility

Benham, C., Kannan, S., Paterson, M. & Warnow, T., Jan 1 1995, In : Journal of Computational Biology. 2, 4, p. 515-525 11 p.

Research output: Contribution to journalArticle

Whales
Compatibility
Foot
Molecular Biology
Tooth

Minimizing phylogenetic number to find good evolutionary trees

Goldberg, L. A., Goldberg, P. W., Phillips, C. A., Sweedyk, E. & Warnow, T., Jan 1 1995, Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings. Galil, Z. & Ukkonen, E. (eds.). Springer-Verlag, p. 102-127 26 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 937).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evolutionary Tree
Phylogenetics
Topology
Polynomials
Parsimony

Of chicken teeth and mouse eyes, or generalized character compatibility

Benham, C., Kannan, S. & Warnow, T., Jan 1 1995, Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings. Galil, Z. & Ukkonen, E. (eds.). Springer-Verlag, p. 17-26 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 937).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Compatibility
Mouse
Molecular biology
Models of Computation
Molecular Biology

Tree reconstruction from partial orders

Kannan, S. K. & Warnow, T., Jun 1995, In : SIAM Journal on Computing. 24, 3, p. 511-519 9 p.

Research output: Contribution to journalArticle

Partial Order
Distance Matrix
Linguistics
Computational complexity
NP-complete problem
1996

Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology

Henzinger, M. R., King, V. & Warnow, T., Jan 28 1996, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996. Association for Computing Machinery, p. 333-340 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129447).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Homeomorphic
Biology
Deterministic Algorithm
Batch
Linear Space

Constructing evolutionary trees in the presence of polymorphic characters

Bonet, M., Phillips, C., Warnow, T. & Yooseph, S., Jul 1 1996, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996. Association for Computing Machinery, p. 220-229 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129452).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Polymorphism
Linguistics
Phylogeny

Determining the Evolutionary Tree Using Experiments

Kannan, S. K., Lawler, E. L. & Warnow, T., Jul 1996, In : Journal of Algorithms. 21, 1, p. 26-50 25 p.

Research output: Contribution to journalArticle

Evolutionary Tree
Experiment
Experiments
Labeled Trees
Models of Computation

Minimizing phylogenetic number to find good evolutionary trees

Goldberg, L. A., Goldberg, P. W., Phillips, C. A., Sweedyk, E. & Warnow, T., Dec 5 1996, In : Discrete Applied Mathematics. 71, 1-3, p. 111-136 26 p.

Research output: Contribution to journalArticle

Evolutionary Tree
Phylogenetics
Topology
Polynomials
Parsimony

Reconstructing the evolutionary history of natural languages

Warnow, T., Ringe, D. & Taylor, A., Jan 28 1996, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996. Association for Computing Machinery, p. 314-322 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129447).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Linguistics
Natural Language
Methodology
Resolve
Language

The asymmetric median tree - A new model for building consensus trees

Phillips, C. & Warnow, T., Jan 1 1996, Combinatorial Pattern Matching - 7th Annual Symposium, CPM 1996, Proceedings. Myers, G. & Hirschberg, D. (eds.). Springer-Verlag, p. 234-252 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1075).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Trees (mathematics)
Approximation algorithms
Computational complexity
Polynomials
Model

The asymmetric median tree - A new model for building consensus trees

Phillips, C. & Warnow, T., Dec 5 1996, In : Discrete Applied Mathematics. 71, 1-3, p. 311-335 25 p.

Research output: Contribution to journalArticle

Trees (mathematics)
Approximation algorithms
Computational complexity
Polynomials
Model
1997

A fast algorithm for the computation and enumeration of perfect phylogenies

Kannan, S. & Warnow, T., Dec 1997, In : SIAM Journal on Computing. 26, 6, p. 1749-1763 15 p.

Research output: Contribution to journalArticle

Phylogeny
Enumeration
Fast Algorithm
Polynomials
Biology

Constructing big trees from short sequences

Erdős, P. L., Steel, M. A., Székely, L. A. & Warnow, T. J., Jan 1 1997, Automata, Languages and Programming - 24th International Colloquium, ICALP 1997, Proceedings. Degano, P., Gorrieri, R. & Marchetti-Spaccamela, A. (eds.). Springer-Verlag, p. 827-837 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1256).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evolutionary Tree
Topology
Polynomials
Trees (mathematics)
Approximation algorithms

Inferring evolutionary trees from polymorphic characters, and an analysis of the Indo-European family of languages

Bonet, M., Phillips, C., Warnow, T. & Yooseph, S., 1997, Mathematical hierarchies and biology (Piscataway, NJ, 1996). Amer. Math. Soc., Providence, RI, Vol. 37. p. 43-55 13 p. (DIMACS Ser. Discrete Math. Theoret. Comput. Sci.).

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule

ErdH os, P., Steel, M. A., Székely, L. & Warnow, T. J., 1997, In : Computing and Informatics. 16, 2, p. 217-227 11 p.

Research output: Contribution to journalArticle

Mathematical approaches to comparative linguistics

Warnow, T., Jun 24 1997, In : Proceedings of the National Academy of Sciences of the United States of America. 94, 13, p. 6585-6590 6 p.

Research output: Contribution to journalArticle

Linguistics
Language
History

Parsimony is hard to beat!

Rice, K. & Warnow, T., Jan 1 1997, Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings. Jiang, T. & Lee, D. T. (eds.). Springer-Verlag, p. 124-133 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1276).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Parsimony
Beat
Joining
Substitution reactions
Experiments
1998

Better methods for solving parsimony and compatibility

Bonet, M., Steel, M., Warnow, T. & Yooseph, S., Jan 1 1998, In : Journal of Computational Biology. 5, 3, p. 391-407 17 p.

Research output: Contribution to journalArticle

Parsimony
Linguistics
Compatibility
Polynomials
Computational complexity

Better methods for solving parsimony and compatibility

Bonet, M., Steel, M., Warnow, T. & Yooseph, S., 1998, Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB. Anon (ed.). ACM, p. 40-49 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Linguistics
Polynomials
Computational complexity
Hardness
Topology

Computing the local consensus of trees

Kannan, S., Warnow, T. & Yooseph, S., Dec 1998, In : SIAM Journal on Computing. 27, 6, p. 1695-1724 30 p.

Research output: Contribution to journalArticle

Computing
Linguistics
Polynomials
Evolutionary Tree
Tie
1999

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

Erdos, P. L., Steel, M. A., Székely, L. A. & Warnow, T., Jun 28 1999, In : Theoretical Computer Science. 221, 1-2, p. 77-118 42 p.

Research output: Contribution to journalArticle

Joining
Computer science
Computational complexity
Topology
Polynomials

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

ErdH os, P. L., Steel, M. A., Székely, L. A. & Warnow, T. J., 1999, In : Theoretical Computer Science. 221, 1-2, p. 77-118 42 p.

Research output: Contribution to journalArticle

A few logs suffice to build (almost) all trees (I)

Erdos, P. L., Steel, M. A., Székely, L. A. & Warnow, T., Mar 1999, In : Random Structures and Algorithms. 14, 2, p. 153-184 32 p.

Research output: Contribution to journalArticle

Mutation
Polynomials
Evolutionary Tree
Labeled Trees
Phylogenetic Tree

Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology

Henzinger, M. R., King, V. & Warnow, T., May 1999, In : Algorithmica (New York). 24, 1, p. 1-13 13 p.

Research output: Contribution to journalArticle

Homeomorphic
Biology
Deterministic Algorithm
Batch
Linear Space

Constructing evolutionary trees in the presence of polymorphic characters

Bonet, M., Phillips, C., Warnow, T. & Yooseph, S., Sep 1999, In : SIAM Journal on Computing. 29, 1, p. 103-131 29 p.

Research output: Contribution to journalArticle

Evolutionary Tree
Polymorphism
Linguistics
Monomorphism
Phylogeny

Disk-covering, a fast-converging method for phylogenetic tree reconstruction

Huson, D. H., Nettles, S. M. & Warnow, T., Sep 1 1999, In : Journal of Computational Biology. 6, 3-4, p. 369-386 18 p.

Research output: Contribution to journalArticle

Phylogenetic Tree
Covering
Markov Model
Leaves
Topology

Estimating large distances in phylogenetic reconstruction

Huson, D. H., Ann Smith, K. & Warnow, T., 1999, Algorithm Engineering - 3rd International Workshop, WAE 1999, Proceedings. Springer Verlag, Vol. 1668. p. 271-285 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1668).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Phylogenetics
Polynomials
Evolutionary Tree
Phylogenetic Tree
Random Sequence

Hybrid tree reconstruction methods

Huson, D., Nettles, S., Rice, K., Warnow, T. & Yooseph, S., 1999, In : Journal of Experimental Algorithmics. 4, p. 21 1 p.

Research output: Contribution to journalArticle

Obtaining highly accurate topology estimates of evolutionary trees from very short sequences

Huson, D. H., Nettles, S. & Warnow, T., Jan 1 1999, Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB. New York, NY, United States: ACM, p. 198-207 10 p.

Research output: Chapter in Book/Report/Conference proceedingChapter

Joining
Topology
Polynomials
Nucleotides
Computer science