SLINK - OPTIMALLY EFFICIENT ALGORITHM FOR SINGLE-LINK CLUSTER METHOD
SLINK - OPTIMALLY EFFICIENT ALGORITHM FOR SINGLE-LINK CLUSTER METHOD
复制标题
DOI：
10.1093/comjnl/16.1.30
复制
发表时间：
1973-01-01
期刊：
影响因子：
1.4
通讯作者：
SIBSON, R
中科院分区：
文献类型：
--
作者：
SIBSON, R
SLINK算法进行单链接（最近邻）聚类分析的任意相异度系数，并提供了一个表示所得到的树状图，可以很容易地转换成通常的树图。该算法实现了理论上的数量级界限的紧凑性的存储和操作速度，并使单链路方法的应用可行的OTU的数量以及到103至104的范围。该算法很容易用包括FORTRAN在内的多种语言编程。
The SLINK algorithm carries out single-link (nearest-neighbour) cluster analysis on an arbitrary dissimilarity coefficient and provides a representation of the resultant dendrogram which can readily be converted into the usual tree-diagram. The algorithm achieves the theoretical order-of-magnitude bounds for both compactness of storage and speed of operation, and makes the application of the single-link method feasible for a number of OTU's well into the range 103to 104. The algorithm is easily programmable in a variety of languages including FORTRAN.