Search For:

Displaying 1-3 out of 3 total
Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics
By Andre Wehe,J. Gordon Burleigh,Oliver Eulenstein
Issue Date:November 2013
pp. 1432-1441
Phylogenetic inference is a computationally difficult problem, and constructing high-quality phylogenies that can build upon existing phylogenetic knowledge and synthesize insights from new data remains a major challenge. We introduce knowledge-enhanced ph...
 
Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
By Andre Wehe, J. Gordon Burleigh, Oliver Eulenstein
Issue Date:November 2013
pp. 1432-1441
Phylogenetic inference is a computationally difficult problem, and constructing high-quality phylogenies that can build upon existing phylogenetic knowledge and synthesize insights from new data remains a major challenge. We introduce knowledge-enhanced ph...
     
Fast Local Search for Unrooted Robinson-Foulds Supertrees
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
By David Fernandez-Baca, J. Gordon Burleigh, Ruchi Chaudhary
Issue Date:July 2012
pp. 1004-1013
A Robinson-Foulds (RF) supertree for a collection of input trees is a tree containing all the species in the input trees that is at minimum total RF distance to the input trees. Thus, an RF supertree is consistent with the maximum number of splits in the i...
     
 1