Alexandros Stamatakis

Summary

Affiliation: TU Munich
Country: Germany

Publications

  1. ncbi request reprint RAxML-III: a fast program for maximum likelihood-based inference of large phylogenetic trees
    A Stamatakis
    Department of Computer Science, Technical University of Munich Boltzmannstrasse 3, D 85748 München, Germany
    Bioinformatics 21:456-63. 2005
  2. pmc Time and memory efficient likelihood-based tree searches on phylogenomic alignments with missing data
    Alexandros Stamatakis
    The Exelixis Lab I12, Department of Computer Science, Technische Universitat Munchen, Boltzmannstr 3, D 85748, Garching b München, Germany
    Bioinformatics 26:i132-9. 2010
  3. doi request reprint A rapid bootstrap algorithm for the RAxML Web servers
    Alexandros Stamatakis
    Exelixis Lab, Teaching and Research Unit Bioinformatics, Department of Computer Science, Ludwig Maximilians University Munich, Munich, Germany
    Syst Biol 57:758-71. 2008
  4. pmc ARB: a software environment for sequence data
    Wolfgang Ludwig
    Lehrstuhl fur Mikrobiologie, Technische Universitat Munchen, D 853530 Freising, Germany
    Nucleic Acids Res 32:1363-71. 2004

Detail Information

Publications4

  1. ncbi request reprint RAxML-III: a fast program for maximum likelihood-based inference of large phylogenetic trees
    A Stamatakis
    Department of Computer Science, Technical University of Munich Boltzmannstrasse 3, D 85748 München, Germany
    Bioinformatics 21:456-63. 2005
    ..Due to the combinatorial and computational complexity the size of trees which can be computed on a Biologist's PC workstation within reasonable time is limited to trees containing approximately 100 taxa...
  2. pmc Time and memory efficient likelihood-based tree searches on phylogenomic alignments with missing data
    Alexandros Stamatakis
    The Exelixis Lab I12, Department of Computer Science, Technische Universitat Munchen, Boltzmannstr 3, D 85748, Garching b München, Germany
    Bioinformatics 26:i132-9. 2010
    ..We also introduce a set of algorithmic rules to efficiently conduct tree searches via subtree pruning and re-grafting moves using this mechanism...
  3. doi request reprint A rapid bootstrap algorithm for the RAxML Web servers
    Alexandros Stamatakis
    Exelixis Lab, Teaching and Research Unit Bioinformatics, Department of Computer Science, Ludwig Maximilians University Munich, Munich, Germany
    Syst Biol 57:758-71. 2008
    ..These Web servers offer the possibility to conduct large-scale phylogenetic inferences to a large part of the community that does not have access to, or the expertise to use, high-performance computing resources...
  4. pmc ARB: a software environment for sequence data
    Wolfgang Ludwig
    Lehrstuhl fur Mikrobiologie, Technische Universitat Munchen, D 853530 Freising, Germany
    Nucleic Acids Res 32:1363-71. 2004
    ..Currently, the package is used by numerous working groups worldwide...