论文信息 - QuickJoin - fast neighbour-joining tree reconstruction

QuickJoin - fast neighbour-joining tree reconstruction

We have built a tool for fast construction of very large phylogenetic trees. The tool uses heuristics for speeding up the neighbour-joining algorithm-while still constructing the same tree as the original neighbour-joining algorithm-making it possible to construct trees for 8000 species in <10 min on a single desktop PC. In comparison, the same task takes more than 30 min using the QuickTree neighbour-joining implementation.

Thomas Mailund | Christian N. S. Pedersen

[1] N. Saitou,et al. The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.

[2] J. A. Studier,et al. A note on the neighbor-joining algorithm of Saitou and Nei. , 1988, Molecular biology and evolution.

[3] Jon Louis Bentley,et al. Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[4] Alex Bateman,et al. QuickTree: building huge Neighbour-Joining trees of protein sequences , 2002, Bioinform..

[5] Robert D. Finn,et al. The Pfam protein families database , 2004, Nucleic Acids Res..