DAxML: A Program for Distributed Computation of Phylogenetic Trees Based on Load Managed CORBA

  • Alexandros P. Stamatakis
  • Markus Lindermeier
  • Michael Ott
  • Thomas Ludwig
  • Harald Meier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2763)


High performance computing in bioinformatics has led to important progress in the field of genome analysis. Due to the huge amount of data and the complexity of the underlying algorithms many problems can only be solved by using supercomputers. In this paper we present DAxML, a program for the distributed computation of evolutionary trees. In contrast to prior approaches DAxML runs on a cluster of workstations instead of an expensive supercomputer. For this purpose we transformed PAxML, a fast parallel phylogeny program incorporating novel algorithmic optimizations, into a distributed application. DAxML uses modern object-oriented middleware instead of message-passing communication in order to reduce the development and maintenance costs. Our goal is to provide DAxML to a broad range of users, in particular those who do not have supercomputers at their disposal. We ensure high performance and scalability by applying a high-level load management service called LMC (Load Managed CORBA). LMC provides transparent system level load management by integrating the load management functionality directly into the ORB. In this paper we demonstrate the simplicity of integrating LMC into a real-world application and how it enhances the performance and scalability of DAxML.


IEEE Computer Society Tree Topology Initial Placement Common Object Request Broker Architecture Topology Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Brose, G.: JacORB: Implementation and Design of a Java ORB. In: International Conference on Distributed Applications and Interoperable Systems (DAIS 1997). Chapman & Hal, Boca Raton (1997)Google Scholar
  2. 2.
    Felsenstein, J.: Evolutionary trees from DNA sequences: A maximum likelihood approach. J. Mol. Evol. 17, 368–376 (1981)CrossRefGoogle Scholar
  3. 3.
    Korber, B., Muldoon, M., Theiler, J., Gao, F., Gupta, R., Lapedes, A., Hahn, B.H., Wolinsky, S., Bhattacharya, T.: Timing the ancestor of the HIV-1 pandemic strains. Science 288, 1789–1796 (2000)CrossRefGoogle Scholar
  4. 4.
    Jermiin, L.S., Olsen, G.J., Mengersen, K.L., Easteal, S.: Majority-rule consensus of phylogenetic trees obtained by maximum-likelihood analysis. Mol. Biol. Evol. 14, 1297–1302 (1997)CrossRefGoogle Scholar
  5. 5.
    Lindermeier, M.: Load Management for Distributed Object-Oriented Environments. In: Proceedings of 2nd International Symposium on Distributed Objects and Applications (DOA 2000), pp. 59–68. IEEE Computer Society, Los Alamitos (2000)CrossRefGoogle Scholar
  6. 6.
    Lindermeier, M.: Ein Konzept zur Lastverwaltung in verteilten objektorientierten Systemen (A concept for load managment in distributed object-oriented systems). Ph.D. thesis. Technical University of Munich (2002)Google Scholar
  7. 7.
    Olsen, G.J., Matsuda, H., Hagstrom, R., Overbeek, R.: fastDNAml: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood. Comput. Appl. Biosci. 10, 41–48 (1994)Google Scholar
  8. 8.
    ParBaum homepage, PAxML download:
  9. 9.
    Search for Extraterrestrial Intelligence at Home:
  10. 10.
    Stamatakis, A.P., Ludwig, T., Meier, H., Wolf, M.J.: AxML: A Fast Program for Sequential and Parallel Phylogenetic Tree Calculations Based on the Maximum Likelihood Method. In: Proceedings of 1st IEEE Computer Society Bioinformatics Conference (CSB 2002). IEEE Computer Society, Los Alamitos (2002)Google Scholar
  11. 11.
    Stamatakis, A.P., Ludwig, T., Meier, H., Wolf, M.J.: Accelerating Parallel Maximum Likelihood-based Phylogenetic Tree Computations using Subtree Equality Vectors. In: Proceedings of Supercomputing Conference (SC2002). IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
  12. 12.
    Stamatakis, A.P., Ludwig, T., Meier, H.: Adapting PAxML to the Hitachi SR8000-F1 Supercomputer. In: Proceedings of 1. Joint HLRB and KONWIHR Workshop (2002)Google Scholar
  13. 13.
    Stamatakis, A.P., Ludwig, T.: Phylogenetic Tree Inference on PC Architectures with AxML/PAxML. In: Proceedings of IPDPS2003, High Performance Computational Biology Workshop (HICOMB), IEEE Computer Society, Los Alamitos (2003)Google Scholar
  14. 14.
    Stewart, C.A., Hart, D., Berry, D.K., Olsen, G.J., Wernert, E., Fischer, W.: Parallel implementation and performance of fastDNAml – a program for maximum likelihood phylogenetic inference. In: Proceedings of Supercomputing Conference 2001 (SC2001). IEEE Computer Society, Los Alamitos (2001)Google Scholar
  15. 15.
    Stewart, C.A., Tan, T.W., Buchhorn, M., Hart, D., Berry, D., Zhang, L., Wernert, E., Sakharkar, M., Fisher, W., McMullen, D.: Evolutionary biology and computational grids. In: IBM CASCON 1999 Computational Biology Workshop: Software Tools for Computational Biology (1999)Google Scholar
  16. 16.
    The ARB project:

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Alexandros P. Stamatakis
    • 1
  • Markus Lindermeier
    • 1
  • Michael Ott
    • 1
  • Thomas Ludwig
    • 2
  • Harald Meier
    • 1
  1. 1.Department of Computer ScienceTechnical University of MunichGarching b. MünchenGermany
  2. 2.Department of Computer ScienceRuprecht-Karls UniversityHeidelbergGermany

Personalised recommendations