The Community for Technology Leaders
RSS Icon
Subscribe
Denver, Colorado
Nov. 10, 2001 to Nov. 16, 2001
ISBN: 1-58113-293-X
pp: 32
Craig A. Stewart , Indiana University
David Hart , Indiana University
Donald K. Berry , Indiana University
Gary J. Olsen , University of Illinois Urbana/Champaign
Eric A. Wernert , Indiana University
William Fischer , Indiana University
ABSTRACT
This paper describes the parallel implementation of fastDNAml, a program for the maximum likelihood inference of phylogenetic trees from DNA sequence data. Mathematical means of inferring phylogenetic trees have been made possible by the wealth of DNA data now available. Maximum likelihood analysis of phylogenetic trees is extremely computationally intensive. Availability of computer resources is a key factor limiting use of such analyses. fastDNAml is implemented in serial, PVM, and MPI versions, and may be modified to use other message passing libraries in the future. We have developed a viewer for comparing phylogenies. We tested the scaling behavior of fastDNAml on an IBM RS/6000 SP up to 64 processors. The parallel version of fastDNAml is one of very few computational phylogenetics codes that scale well. fastDNAml is available for download as source code or compiled for Linux or AIX.
INDEX TERMS
Phylogenetics, bioinformatics, maximum likelihood, parallel applications, scalability
CITATION
Craig A. Stewart, David Hart, Donald K. Berry, Gary J. Olsen, Eric A. Wernert, William Fischer, "Parallel Implementation and Performance of FastDNAml — A Program for Maximum Likelihood Phylogenetic Inference", SC, 2001, SC Conference, SC Conference 2001, pp. 32, doi:10.1109/SC.2001.10001
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool