The DOGMA Approach to High-Utilization Supercomputing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
An Enterprise-Based Grid Resource Management System
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
DRAxML@home: a distributed program for computation of large phylogenetic trees
Future Generation Computer Systems - Special issue: Parallel computing technologies
Jumpstarting phylogenetic analysis
International Journal of Bioinformatics Research and Applications
DRAxML@home: a distributed program for computation of large phylogenetic trees
Future Generation Computer Systems - Special issue: Parallel computing technologies
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
| Hi-index | 0.00 |
Recent advances in DNA sequencing technology have created large data sets upon which phylogenetic inference can be performed. However, current research is limited by the prohibitive time necessary to perform tree search on even a reasonably-sized data set. Some parallel algorithms have been developed but the biological research community does not use them because they do not trust the results from newly developed parallel software. This paper presents a new phylogenetic algorithm that allows existing, trusted phylogenetic software packages to be executed in parallel using the DOGMA parallel processing system. The results presented here indicate that data sets that currently take as much as 11 months to search using current algorithms, can be searched in as little as two hours using as few as eight processors. This reduction in the time necessary to complete a phylogenetic search allows new research questions to be explored in many of the biological sciences.