Parallel implementation of a quartet-based algorithm for phylogenetic analysis

B. B. Zhou*, D. Chu, M. Tarawneh, P. Wang, C. Wang, A. Y. Zomaya, R. P. Brent

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    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.

    Original languageEnglish
    Title of host publication20th International Parallel and Distributed Processing Symposium, IPDPS 2006
    PublisherIEEE Computer Society
    ISBN (Print)1424400546, 9781424400546
    DOIs
    Publication statusPublished - 2006
    Event20th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2006 - Rhodes Island, Greece
    Duration: 25 Apr 200629 Apr 2006

    Publication series

    Name20th International Parallel and Distributed Processing Symposium, IPDPS 2006
    Volume2006

    Conference

    Conference20th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2006
    Country/TerritoryGreece
    CityRhodes Island
    Period25/04/0629/04/06

    Fingerprint

    Dive into the research topics of 'Parallel implementation of a quartet-based algorithm for phylogenetic analysis'. Together they form a unique fingerprint.

    Cite this