Building large phylogenetic trees on coarse-grained parallel machines

Keane, T.M. and Page, A.J. and Naughton, Thomas J. and Travers, S.A.A. and McInerney, J.O. (2005) Building large phylogenetic trees on coarse-grained parallel machines. Algorithmica. (In Press)

[img] Download (326kB)

Share your research

Twitter Facebook LinkedIn GooglePlus Email more...

Add this article to your Mendeley library


Phylogenetic analysis is an area of computational biology concerned with the reconstruction of evolutionary relationships between organisms, genes, and gene families. Maximum likelihood evaluation has proven to be one of the most reliable methods for constructing phylogenetic trees. The huge computa- tional requirements associated with maximum likelihood analysis means that it is not feasible to produce large phylogenetic trees using a single processor. We have completed a fully cross platform coarse grained distributed application, DPRml, which overcomes many of the limitations imposed by the current set of parallel phylogenetic programs. We have completed a set of efficiency tests that show how to maximise efficiency while using the program to build large phylogenetic trees. The software is publicly available under the terms of the GNU general public li- cence from the system webpage at

Item Type: Article
Keywords: bioinfomatics, distributed computing
Academic Unit: Faculty of Science and Engineering > Computer Science
Item ID: 237
Depositing User: Andrew Page
Date Deposited: 18 Aug 2005
Journal or Publication Title: Algorithmica
Publisher: Springer
Refereed: Yes

    Repository Staff Only(login required)

    View Item Item control page

    Document Downloads

    More statistics for this item...