pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies
- 26 July 2005
- journal article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 21 (19), 3794-3796
- https://doi.org/10.1093/bioinformatics/bti594
Abstract
IQPNNI is a program to infer maximum-likelihood phylogenetic trees from DNA or protein data with a large number of sequences. We present an improved and MPI-parallel implementation showing very good scaling and speed-up behavior.Keywords
This publication has 13 references indexed in Scilit:
- DPRml: distributed phylogeny reconstruction by maximum likelihoodBioinformatics, 2004
- The AxML program family for maximum likelihood‐based phylogenetic tree inferenceConcurrency and Computation: Practice and Experience, 2004
- Parallel Metropolis coupled Markov chain Monte Carlo for Bayesian phylogenetic inferenceBioinformatics, 2004
- A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum LikelihoodSystematic Biology, 2003
- TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computingBioinformatics, 2002
- BIONJ: an improved version of the NJ algorithm based on a simple model of sequence dataMolecular Biology and Evolution, 1997
- Quartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree TopologiesMolecular Biology and Evolution, 1996
- fastDNAml: a tool for construction of phylogenetic trees of DNA sequences using maximum likelihoodBioinformatics, 1994
- Dating of the human-ape splitting by a molecular clock of mitochondrial DNAJournal of Molecular Evolution, 1985
- Evolutionary trees from DNA sequences: A maximum likelihood approachJournal of Molecular Evolution, 1981