Close
Help





JOURNAL

Evolutionary Bioinformatics

MGUPGMA: A Fast UPGMA Algorithm With Multiple Graphics Processing Units Using NCCL

Submit a Paper


Evolutionary Bioinformatics 2017:13 1176934317734220

Review

Published on 04 Oct 2017

DOI: 10.1177/1176934317734220


Further metadata provided in PDF



Sign up for email alerts to receive notifications of new articles published in Evolutionary Bioinformatics

Abstract

A phylogenetic tree is a visual diagram of the relationship between a set of biological species. The scientists usually use it to analyze many characteristics of the species. The distance-matrix methods, such as Unweighted Pair Group Method with Arithmetic Mean and Neighbor Joining, construct a phylogenetic tree by calculating pairwise genetic distances between taxa. These methods have the computational performance issue. Although several new methods with high-performance hardware and frameworks have been proposed, the issue still exists. In this work, a novel parallel Unweighted Pair Group Method with Arithmetic Mean approach on multiple Graphics Processing Units is proposed to construct a phylogenetic tree from extremely large set of sequences. The experimental results present that the proposed approach on a DGX-1 server with 8 NVIDIA P100 graphic cards achieves approximately 3-fold to 7-fold speedup over the implementation of Unweighted Pair Group Method with Arithmetic Mean on a modern CPU and a single GPU, respectively.



Downloads

PDF  (1.08 MB PDF FORMAT)

RIS citation   (ENDNOTE, REFERENCE MANAGER, PROCITE, REFWORKS)

XML   (44.16 KB XML FORMAT)

BibTex citation   (BIBDESK, LATEX)





Quick Links


New article and journal news notification services