Fingerprint Fingerprint is based on mining the text of the expert's scholarly documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

Datasets Medicine & Life Sciences
Polynomials Engineering & Materials Science
Phylogeny Engineering & Materials Science
Genes Medicine & Life Sciences
Sequence Alignment Medicine & Life Sciences
Phylogenetics Mathematics
Genome Medicine & Life Sciences
Gene Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 1991 2017

Enhancing searches for optimal trees using SIESTA

Vachaspati, P. & Warnow, T. 2017 Comparative Genomics - 15th International Workshop, RECOMB CG 2017, Proceedings. Springer Verlag, Vol. 10562 LNBI, 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: ResearchConference contribution

Trees (mathematics)
Dynamic programming
Set theory
Polynomials
Search Space

FastRFS: Fast and accurate Robinson-Foulds Supertrees using constrained exact optimization

Vachaspati, P. & Warnow, T. 2017 In : Bioinformatics. 33, 5, p. 631-639 9 p.

Research output: Research - peer-reviewArticle

Optimization
Constrained optimization
Datasets
Large Data Sets
NP-complete problem

Gene tree parsimony for incomplete gene trees

Bayzid, M. S. & Warnow, T. Aug 1 2017 17th International Workshop on Algorithms in Bioinformatics, WABI 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 88, 2

Research output: ResearchConference contribution

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. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 88, 27

Research output: ResearchConference contribution

Polynomials

An analytical upper bound on the number of loci required for all splits of a species tree to appear in a set of gene trees

Uricchio, L. H., Warnow, T. & Rosenberg, N. A. Nov 11 2016 In : BMC Bioinformatics. 17, 417

Research output: Research - peer-reviewArticle

Locus
Upper bound
Gene
Genes
Model

Datasets

Data from: The Performance of Coalescent-Based Species Tree Estimation Methods under Models of Missing Data

Nute, M. (Creator), Chou, J. (Creator), Molloy, E. K. (Creator), Warnow, T. (Creator), University of Illinois at Urbana-Champaign, 2017

Dataset

Datasets from the study: Optimal completion of incomplete gene trees in polynomial time using OCTAL

Christensen, S. (Creator), Molloy, E. K. (Creator), Vachaspati, P. (Creator), Warnow, T. (Creator), University of Illinois at Urbana-Champaign, 2017

Dataset

HIPPI Dataset

Nguyen, N. (Creator), Nute, M. (Creator), Mirarab, S. (Creator), Warnow, T. (Creator), University of Illinois at Urbana-Champaign, 2016

Dataset