IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-26657-0_24.html
   My bibliography  Save this book chapter

A Fast Program for Phylogenetic Tree Inference with Maximum Likelihood

In: High Performance Computing in Science and Engineering, Munich 2004

Author

Listed:
  • Alexandros P. Stamatakis

    (Technische Universität München, Department of Computer Science)

  • Thomas Ludwig

    (Ruprecht-Karls-Universität, Department of Computer Science)

  • Harald Meier

    (Technische Universität München, Department of Computer Science)

Abstract

Inference of large phylogenetic trees using elaborate statistical models is computationally extremely intensive. Thus, progress is primarily achieved via algorithmic innovation rather than by brute-force allocation of all available computational resources. We present simple heuristics which yield accurate trees for synthetic (simulated) as well as real data and improve execution time compared to the currently fastest programs. The new heuristics are implemented in a sequential program (RAxML) which is available as open source code. Furthermore, we present a non-deterministic parallel version of our algorithm which in some cases yielded super-linear speedups for computations with 1000 organisms. We compare sequential RAxML performance with the currently fastest and most accurate programs for phylogenetic tree inference based on statistical methods using 50 synthetic alignments and 9 real-world alignments comprising up to 1000 sequences. RAxML outperforms those programs for real-world data in terms of speed and final likelihood values.

Suggested Citation

  • Alexandros P. Stamatakis & Thomas Ludwig & Harald Meier, 2005. "A Fast Program for Phylogenetic Tree Inference with Maximum Likelihood," Springer Books, in: Siegfried Wagner & Werner Hanke & Arndt Bode & Franz Durst (ed.), High Performance Computing in Science and Engineering, Munich 2004, pages 273-283, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-26657-0_24
    DOI: 10.1007/3-540-26657-7_24
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-26657-0_24. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.