1. Aho, A. V., Hopcroft, J. E., & Ullman, J. D. (1974). The design and analysis of computer algorithms (pp. 74–84). Reading: Addison-Wesley.
2. Asprejan, J.-D. (1966). Un algorithme pour construire des classes d’après une matrice de distance. Mashinnyi Perevod i Prikladnaja Lingvistika, 9, 3–18.
3. Bandelt, H.-J. (1992). Four-point characterization of the dissimilarity function obtained from indexed closed weak hierarchies. Mathematisches Seminar, Hamburg Universität.
4. Bandelt, H.-J., & Dress, W. M. (1989). Weak hierarchies associated with a similarity measure—an additive clustering technique. Bulletin of Mathematical Biology, 51(1), 133–166.
5. Bandelt, H.-J., & Dress, W. M. (1994). An order theoretic framework for overlapping clustering. Discrete Mathematics, 136, 21–37.