Keane, T.M., Page, A.J., Naughton, Thomas J., Travers, S.A.A. and McInerney, J.O. (2005) Building large phylogenetic trees on coarse-grained parallel machines. Algorithmica. (In Press)
PDF
KPN2005j.pdf
Download (326kB)
KPN2005j.pdf
Download (326kB)
Abstract
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 efï¬ciency tests that show how
to maximise efï¬ciency 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 http://www.cs.nuim.ie/distributed
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 |
URI: | https://mural.maynoothuniversity.ie/id/eprint/237 |
Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only (login required)
Downloads
Downloads per month over past year