Adapting PAxML to the Hitachi SR8000-F1 Supercomputer

DOI10.1007/978-3-642-55526-8_36MaRDI QIDQ4429613zbMATH OpenOpenAlexFDO

Authors Alexandros Stamatakis, Thomas Ludwig, Harald Meier

Publication date 26 September 2003

Published in High Performance Computing in Science and Engineering, Munich 2002 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-55526-8_36

zbMATH Keywords

optimal phylogenetic tree

Mathematics Subject Classification ID

Computer system organization (68M99)

Recommendations

• Euro-Par 2004 Parallel Processing
• ParBaum: Large-scale maximum likelihood-based phylogenetic analyses
• Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion
• Reconstruction of large phylogenetic trees: a parallel approach
• Parallel implementation of DNAml program on message-passing architectures

Cited in

(4)

• Euro-Par 2004 Parallel Processing
• fastDNAml
• PAxML
• ParBaum: Large-scale maximum likelihood-based phylogenetic analyses

This page was built for publication: Adapting PAxML to the Hitachi SR8000-F1 Supercomputer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429613)