Parallelizing SuperFine

Authors:
Diogo Telmo Neves;Tandy Warnow;João Luís Sobral;Keshav Pingali
Affiliations:
ESTGF - IPP and Universidade do Minho Portugal;The Univ. of Texas at Austin Austin, TX;Universidade do Minho Portugal;The Univ. of Texas at Austin Austin, TX
Venue:
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Year:
2012

Citing 7
Cited 0

A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application

SIAM Journal on Computing
A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Minimum-Flip Supertrees: Complexity and Algorithms

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models

Bioinformatics
A simulation study comparing supertree and combined analysis methods using SMIDGen

WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
SuperTriplets

Bioinformatics
An experimental study of quartets MaxCut and other supertree methods

WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The estimation of the Tree of Life, a rooted binary tree representing how all extant species evolved from a common ancestor, is one of the grand challenges of modern biology. Research groups around the world are attempting to estimate evolutionary trees on particular sets of species (typically clades, or rooted subtrees), in the hope that a final "supertree" can be produced from these smaller estimated trees through the addition of a "scaffold" tree of randomly sampled taxa from the tree of life. However, supertree estimation is itself a computationally challenging problem, because the most accurate trees are produced by running heuristics for NP-hard problems. In this paper we report on a study in which we parallelize SuperFine, the currently most accurate and efficient supertree estimation method. We explore performance of these parallel implementations on simulated data-sets with 1000 taxa and biological data-sets with up to 2,228 taxa. Our study reveals aspects of SuperFine that limit the speed-ups that are possible through the type of outer-loop parallelism we exploit.