QuickJoin - fast neighbour-joining tree reconstruction

被引：24

作者：

Mailund, T ^{[1
]}

Pedersen, CNS ^{[1
]}

机构：

[1] Aarhus Univ, Bioinformat Res Ctr, DK-8000 Aarhus C, Denmark

来源：

BIOINFORMATICS | 2004年 / 20卷 / 17期

关键词：

D O I：

10.1093/bioinformatics/bth359

中图分类号：

Q5 [生物化学];

学科分类号：

071010 ; 081704 ;

摘要：

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.

引用

页码：3261 / 3262

页数：2

共 6 条

[1]

Bateman A, 2004, NUCLEIC ACIDS RES, V32, pD138, DOI [10.1093/nar/gkp985, 10.1093/nar/gkr1065, 10.1093/nar/gkh121]

[2]

BRODAL G, 2003, ALCOMFTTR03102

[3]

Finkel R. A., 1974, Acta Informatica, V4, P1, DOI 10.1007/BF00288933

[4] QuickTree: building huge Neighbour-Joining trees of protein sequences [J].