Year: 2019
Type: article
Abstract: MOTIVATION: Evolutionary histories can change from one part of the genome to another. The potential for discordance between the gene trees has motivated the development of summary methods that reconstruct a species tree from an input collection of gene trees. ASTRAL is a widely used summary method and has been able to scale to relatively large datasets. However, the size of genomic datasets is quickly growing. Despite its relative efficiency, the current single-threaded implementation of ASTRAL is falling behind the data growth trends is not able to analyze the largest available datasets in a reasonable time. RESULTS: ASTRAL uses dynamic programing and is not trivially parallel. In this paper, we introduce ASTRAL-MP, the first version of ASTRAL that can exploit parallelism and also uses randomization techniques to speed up some of its steps. Importantly, ASTRAL-MP can take advantage of not just multiple CPU cores but also one or several graphics processing units (GPUs). The ASTRAL-MP code scales very well with increasing CPU cores, and its GPU version, implemented in OpenCL, can have up to 158× speedups compared to ASTRAL-III. Using GPUs and multiple cores, ASTRAL-MP is able to analyze datasets with 10 000 species or datasets with more than 100 000 genes in <2 days. AVAILABILITY AND IMPLEMENTATION: ASTRAL-MP is available at https://github.com/smirarab/ASTRAL/tree/MP. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Source: Bioinformatics
Authors: John Yin, Chao Zhang, Siavash Mirarab
Institution: University of California San Diego
Language: English
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: bronze
OpenAlex ID: W2943825966