Abstract
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 103 to 104. The algorithm is easily programmable in a variety of languages including FORTRAN.
Keywords
Computer scienceLink (geometry)AlgorithmCluster (spacecraft)DendrogramFortranRange (aeronautics)Representation (politics)DiagramTree (set theory)Compact spaceTheoretical computer scienceMathematicsCombinatoricsProgramming language
Affiliated Institutions
Related Publications
MrBayes 3.2: Efficient Bayesian Phylogenetic Inference and Model Choice Across a Large Model Space
Since its introduction in 2001, MrBayes has grown in popularity as a software package for Bayesian phylogenetic inference using Markov chain Monte Carlo (MCMC) methods. With thi...
Reentrant polygon clipping
A new family of clipping algorithms is described. These algorithms are able to clip polygons against irregular convex plane-faced volumes in three dimensions, removing the parts...
Finite-Mixture Structural Equation Models for Response-Based Segmentation and Unobserved Heterogeneity
Two endemic problems face researchers in the social sciences (e.g., Marketing, Economics, Psychology, and Finance): unobserved heterogeneity and measurement error in data. Struc...
Publication Info
- Year
- 1973
- Type
- article
- Volume
- 16
- Issue
- 1
- Pages
- 30-34
- Citations
- 1163
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1163
OpenAlex
Cite This
Robin Sibson
(1973).
SLINK: An optimally efficient algorithm for the single-link cluster method.
The Computer Journal
, 16
(1)
, 30-34.
https://doi.org/10.1093/comjnl/16.1.30
Identifiers
- DOI
- 10.1093/comjnl/16.1.30