DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2012.162
Andre Wehe , University of Florida, Gainesville and Iowa State University, Ames
J. Gordon Burleigh , University of Florida, Gainesville
Oliver Eulenstein , Iowa State University, Ames
Phylogenetic inference is a computationally difficult problem, and constructing high quality phylogenetic trees that can build upon existing phylogenetic knowledge and synthesize insights from new data remains a major challenge. We introduce knowledge-enhanced phylogenetic problems for both supertree and supermatrix phylogenetic analyses. These problems seek an optimal phylogenetic tree that can only be assembled from a user-supplied set of, possibly incompatible, phylogenetic relationships. We describe exact polynomial time algorithms for the knowledge-enhanced versions of the NP-hard Robinson Foulds, gene duplication, duplication and loss, and deep coalescence supertree problems. Further, we demonstrate that our algorithms can rapidly improve upon results of local search heuristics for these problems. Finally, we introduce a knowledge-enhanced search heuristic that can be applied to discrete character data sets using the maximum parsimony (MP) phylogenetic problem. Although this approach is not guaranteed to find exact solutions, we show that it also can improve upon parsimony solutions from commonly used MP heuristics.
supermatrix, phylogenetics, supertree
A. Wehe, J. G. Burleigh and O. Eulenstein, "Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems," in IEEE/ACM Transactions on Computational Biology and Bioinformatics.