Parallel implementation of a quartet-based algorithm for phylogenetic analysis
Date
2006
Authors
Zhou, B. B.
Chu, D.
Tarawmeh, M.
Wang, P.
Wang, C.
Zomaya, Albert Y.
Brent, Richard
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers (IEEE Inc)
Abstract
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.
Description
Keywords
Keywords: Computation theory; DNA sequences; Evolutionary algorithms; Natural sciences computing; Program processors; Trees (mathematics); Evolutionary trees; Phylogenetic analysis; Quartet trees; Topological information; Parallel processing systems
Citation
Collections
Source
Proceedings of International Parallel and Distributed Processing Symposium 2006
Type
Conference paper
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description