Besenbacher Søren, Mailund Thomas, Westh-Nielsen Lasse, Pedersen Christian N S
Bioinformatics Research Center, Department of Computer Science, University of Aarhus, Høegh-Guldbergs Gade 10, Building 090, DK-8000 Arhus C, Denmark.
Bioinformatics. 2005 Apr 15;21(8):1711-2. doi: 10.1093/bioinformatics/bti195. Epub 2004 Dec 7.
We have developed a tool implementing an efficient algorithm for refined Buneman tree reconstruction. The algorithm--which has the same complexity as the neighbour-joining method and the (plain) Buneman tree construction--enables refined Buneman tree reconstruction on large taxa sets.
The source code for RBT, written in Java, is available under the GNU Public License (GPL) at http://www.birc.dk/Software/RBT CONTACT: besen@daimi.au.dk.
我们开发了一种工具,该工具实现了一种用于精细布内曼树重建的高效算法。该算法——其复杂度与邻接法和(普通)布内曼树构建相同——能够对大型分类群集进行精细布内曼树重建。
用Java编写的RBT的源代码可在GNU通用公共许可证(GPL)下从http://www.birc.dk/Software/RBT获取。联系方式:besen@daimi.au.dk 。