Sciweavers

IPPS
2006
IEEE

Parallel implementation of a quartet-based algorithm for phylogenetic analysis

13 years 9 months ago
Parallel implementation of a quartet-based algorithm for phylogenetic analysis
This paper describes a parallel implementation of our recently developed algorithm for phylogenetic analysis on the IBM BlueGene/L cluster [15]. This algorithm constructs evolutionary trees for a given set of DNA or protein sequences based on the topological information of every possible quartet trees. Our experimental results showed that it has several advantages over many popular algorithms. By distributing the quartet weights evenly across the processing nodes and making effective use of a fast collective network on the IBM BlueGene/L cluster, we are able to achieve a close to linear speedup even when the number of processors involved in the computation is large.
Bing Bing Zhou, Daniel Chu, Monther Tarawneh, Ping
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where IPPS
Authors Bing Bing Zhou, Daniel Chu, Monther Tarawneh, Pinghao Wang, Chen Wang, Albert Y. Zomaya, Richard P. Brent
Comments (0)