Mailund Thomas, Pedersen Christian N S
Bioinformatics Research Center (BiRC), University of Aarhus, Høegh-Guldbergs Grade 10, Bldg. 090, DK-8000 Arhus C, Denmark.
Bioinformatics. 2004 Nov 22;20(17):3261-2. doi: 10.1093/bioinformatics/bth359. Epub 2004 Jun 16.
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.
我们构建了一个用于快速构建超大型系统发育树的工具。该工具使用启发式方法来加速邻接法算法，同时仍能构建与原始邻接法算法相同的树，从而能够在一台桌面个人电脑上于不到10分钟内为8000个物种构建树。相比之下，使用QuickTree邻接实现方法完成相同任务需要30多分钟。
Zotero 插件