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

Research Output 1990 2019

Filter
Conference contribution
2019

New Divide-and-Conquer Techniques for Large-Scale Phylogenetic Estimation

Warnow, T., Jan 1 2019, Algorithms for Computational Biology - 6th International Conference, AlCoB 2019, Proceedings. Vega-Rodríguez, M. A., Holmes, I. & Martín-Vide, C. (eds.). Springer-Verlag, p. 3-21 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11488 LNBI).

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

Divide and conquer
Phylogenetics
Scalability
Subset
Large Data Sets

Using INC Within Divide-and-Conquer Phylogeny Estimation

Le, T., Sy, A., Molloy, E. K., Zhang, Q. R., Rao, S. & Warnow, T., Jan 1 2019, Algorithms for Computational Biology - 6th International Conference, AlCoB 2019, Proceedings. Vega-Rodríguez, M. A., Holmes, I. & Martín-Vide, C. (eds.). Springer-Verlag, p. 167-178 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11488 LNBI).

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

Phylogeny
Divide and conquer
Maximum likelihood
Molecular biology
Maximum Likelihood
2018

Are Profile Hidden Markov Models Identifiable?

Pattabiraman, S. & Warnow, T., Aug 15 2018, ACM-BCB 2018 - Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics. Association for Computing Machinery, Inc, p. 448-456 9 p. (ACM-BCB 2018 - Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics).

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

Hidden Markov models
Computational Biology
Sequence Alignment
Statistical Models
Bioinformatics

New absolute fast converging phylogeny estimation methods with improved scalability and accuracy

Zhang, Q., Rao, S. & Warnow, T., Aug 1 2018, 18th International Workshop on Algorithms in Bioinformatics, WABI 2018. Parida, L. & Ukkonen, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 113).

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

Scalability
Joining
Polynomials
Trees (mathematics)
Maximum likelihood

NJMerge: A Generic technique for scaling phylogeny estimation methods and its application to species trees

Molloy, E. K. & Warnow, T., Jan 1 2018, Comparative Genomics - 16th International Conference, RECOMB-CG 2018, Proceedings. Ouangraoua, A. & Blanchette, M. (eds.). Springer-Verlag, p. 260-276 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11183 LNBI).

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

Phylogeny
Scaling
Scalability
Subset
Divide and conquer
2017

Enhancing searches for optimal trees using SIESTA

Vachaspati, P. & Warnow, T., Jan 1 2017, Comparative Genomics - 15th International Workshop, RECOMB CG 2017, Proceedings. Nakhleh, L. & Meidanis, J. (eds.). Springer-Verlag, p. 232-255 24 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10562 LNBI).

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

Trees (mathematics)
Dynamic programming
Set theory
Data structures
Polynomials

Gene tree parsimony for incomplete gene trees

Bayzid, M. S. & Warnow, T., Aug 1 2017, 17th International Workshop on Algorithms in Bioinformatics, WABI 2017. Reinert, K. & Schwartz, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 88).

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

Genes
Sampling
Dynamic programming

Optimal completion of incomplete gene trees in polynomial time using OCTAL

Christensen, S., Molloy, E. K., Vachaspati, P. & Warnow, T., Aug 1 2017, 17th International Workshop on Algorithms in Bioinformatics, WABI 2017. Reinert, K. & Schwartz, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 88).

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

Genes
Polynomials
Binary trees
2015

Ultra-large alignments using ensembles of hidden Markov models

Nguyen, N. P., Mirarab, S., Kumar, K. & Warnow, T., 2015, Research in Computational Molecular Biology - 19th Annual International Conference, RECOMB 2015, Proceedings. Springer Verlag, Vol. 9029. p. 259-260 2 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9029).

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

Hidden Markov models
Markov Model
Alignment
Ensemble
2014

PASTA: Ultra-large multiple sequence alignment

Mirarab, S., Nguyen, N. & Warnow, T., Jan 1 2014, Research in Computational Molecular Biology - 18th Annual International Conference, RECOMB 2014, Proceedings. Springer-Verlag, p. 177-191 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8394 LNBI).

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

Multiple Sequence Alignment
Alignment
Large Data Sets
Data storage equipment
2012

Parallelizing SuperFine

Neves, D. T., Warnow, T., Sobral, J. L. & Pingali, K., Jul 12 2012, 27th Annual ACM Symposium on Applied Computing, SAC 2012. p. 1361-1367 7 p. (Proceedings of the ACM Symposium on Applied Computing).

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

Binary trees
Scaffolds
Computational complexity
2011

Algorithms for MDC-based multi-locus phylogeny inference

Yu, Y., Warnow, T. & Nakhleh, L., Apr 4 2011, Research in Computational Molecular Biology - 15th Annual International Conference, RECOMB 2011, Proceedings. p. 531-545 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6577 LNBI).

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

Phylogeny
Locus
Genes
Gene
Binary trees
2010

An experimental study of quartets MaxCut and other supertree methods

Swenson, M. S., Suri, R., Linder, C. R. & Warnow, T., Nov 10 2010, Algorithms in Bioinformatics - 10th International Workshop, WABI 2010, Proceedings. p. 288-299 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6293 LNBI).

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

Max-cut
Experimental Study
Parsimony
Matrix Representation
Evaluate
2009

A simulation study comparing supertree and combined analysis methods using SMIDGen

Swenson, M. S., Barbançon, F., Linder, C. R. & Warnow, T., Nov 2 2009, Algorithms in Bioinformatics - 9th International Workshop, WABI 2009, Proceedings. p. 333-344 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5724 LNBI).

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

Parsimony
Simulation Study
Matrix Representation
Subset
Maximum likelihood
2008

Beyond gap models: Reconstructing alignments and phylogenies under genomic-scale events

Brudno, M., Moret, B., Linder, R. & Warnow, T., 2008, Pacific Symposium on Biocomputing 2008, PSB 2008. p. 1-2 2 p.

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

Phylogeny

The effect of the guide tree on multiple sequence alignments and subsequent phylogenetic analyses

Nelesen, S., Liu, K., Zhao, D., Linder, C. R. & Warnow, T., Dec 1 2008, Pacific Symposium on Biocomputing 2008, PSB 2008. p. 25-36 12 p. (Pacific Symposium on Biocomputing 2008, PSB 2008).

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

Sequence Alignment
Phylogeny
Muscle
Muscles
2005

Pattern identification in biogeography

Ganapathy, G., Goodson, B., Jansen, R., Ramachandran, V. & Warnow, T., Dec 1 2005, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). p. 116-127 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3692 LNBI).

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

Distance Metric
Polynomials
Polynomial-time Algorithm
Leaves
Metric
2004

On Contract-and-Refine Transformations Between Phylogenetic Trees

Ganapathy, G., Ramachandran, V. & Warnow, T., 2004, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 15. p. 893-902 10 p.

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

Phylogenetic Tree
Contraction
Refinement
Bisection
Maximum Parsimony

Rec-I-DCM3: A fast algorithmic technique for reconstructing large phylogenetic trees

Roshan, U. W., Warnow, T., Moret, B. M. E. & Williams, T. L., Jan 1 2004, Proceedings - 2004 IEEE Computational Systems Bioinformatics Conference, CSB 2004. IEEE Computer Society, p. 98-109 12 p. (Proceedings - 2004 IEEE Computational Systems Bioinformatics Conference, CSB 2004).

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

Maximum likelihood

Reconstructing reticulate evolution in species - Theory and practice

Nakhleh, L., Warnow, T. & Linder, C. R., 2004, RECOMB 2004 - Proceedings of the Eight Annual International Conference on Research in Computational Molecular Biology. Vol. 8. p. 337-346 10 p.

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

Genes
Polynomials
Gene Regulatory Networks
2002

Approximating the complement of the maximum compatible subset of leaves of k trees

Ganapathy, G. & Warnow, T., Jan 1 2002, Approximation Algorithms for Combinatorial Optimization - 5th International Workshop, APPROX 2002, Proceedings. Leonardi, S., Jansen, K. & Vazirani, V. (eds.). Springer-Verlag, p. 122-134 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2462).

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

K-tree
Approximation algorithms
Leaves
Complement
Binary trees

Estimating the deviation from a molecular clock

Nakhleh, L., Roshan, U., Vawter, L. & Warnow, T., Jan 1 2002, Algorithms in Bioinformatics - 2nd International Workshop,WABI 2002, Proceedings. Guigo, R. & Gusfield, D. (eds.). Springer-Verlag, p. 287-299 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2452).

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

Stretch
Clocks
Deviation
Polynomials
Maximum likelihood

Sequence-length requirements for phylogenetic methods

Moret, B. M. E., Roshan, U. & Warnow, T., 2002, Algorithms in Bioinformatics - 2nd International Workshop,WABI 2002, Proceedings. Springer Verlag, Vol. 2452. p. 343-356 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2452).

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

Phylogenetics
Joining
Deviation
Requirements
Experiments
2001

Absolute convergence: True trees from short sequences

Warnow, T., Moret, B. M. E. & John, K. S., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 186-195 10 p.

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

Absolute convergence
Polynomials
Phylogenetic Tree
Unknown Parameters
Demonstrate

Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time

Ganapathysaravanabavan, G. & Warnow, T., Jan 1 2001, Algorithms in Bioinformatics - First International Workshop, WABI 2001 Århus Denmark, August 28-31, 2001 Proceedings. Moret, B. M. E. & Gascuel, O. (eds.). Springer-Verlag, p. 156-163 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2149).

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

Polynomial time
Polynomials
K-tree
Rooted Trees
Maximum Degree

High-performance algorithm engineering for computational phylogenetics

Moret, B. M. E., Bader, D. A. & Warnow, T., Jan 1 2001, Computational Science – ICCS 2001 - International Conference, Proceedings. Alexandrov, V. N., Dongarra, J. J., Juliano, B. A., Renner, R. S. & Kenneth Tan, C. J. (eds.). Springer-Verlag, p. 1012-1021 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2074).

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

Algorithm Engineering
Phylogenetics
High Performance
Phylogeny
Computational Biology

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

Warnow, T., Moret, B. M. E. & John, K. S., Dec 1 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 196-205 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

Human Factors
Phylogenetics
Human engineering
Joining
Experimentation

The performance of phylogenetic methods on trees of bounded diameter

Nakhleh, L., Roshan, U., St. John, K., Sun, J. & Warnow, T., Jan 1 2001, Algorithms in Bioinformatics - First International Workshop, WABI 2001 Århus Denmark, August 28-31, 2001 Proceedings. Moret, B. M. E. & Gascuel, O. (eds.). Springer-Verlag, p. 214-226 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2149).

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

Phylogenetics
Joining
Empirical Study
Convergence Rate
Rate of Convergence
1999

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
1998

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
1997

Constructing big trees from short sequences

Erdős, P. L., Steel, M. A., Székely, L. A. & Warnow, T., 1997, Automata, Languages and Programming - 24th International Colloquium, ICALP 1997, Proceedings. Springer Verlag, Vol. 1256. 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

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
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

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
1995

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 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

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

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
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

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
1992

Two strikes against perfect phylogeny

Bodlaender, H. L., Fellows, M. R. & Warnow, T., 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
1991

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

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

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