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...
 
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics
By Mukul S. Bansal, Oliver Eulenstein, André Wehe
Issue Date:April 2009
pp. 221-231
The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene-duplication events. This problem is NP-complete and thus requires efficient and effective heuristics. Existing heu...
 
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...
     
 1