A structured family of clustering and tree construction methods

Advances in Applied Mathematics

Volumn 27, Issue 4, 2001, Pages 705-732

  Bryant, David ^a,b   Berry, Vincent ^a  

^a LIRMM   (France)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Algorithms; Average linkage tree; Classification; Clustering; Compatibility; Hierarchies; Quartets; Single linkage tree; Splits; Tree construction

Indexed keywords

EID: 0035520072     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.2001.0758     Document Type: Article

References (24)

1. An algorithm for constructing clusters from a distance matrix
2. Weak hierarchies associated with similarity measures-an additive clustering technique
3. A canonical decomposition theory for metrics on a finite set
4. Faster reliable phylogenetic analysis
5. Quartet cleaning: Improved algorithms and simulations
6. Inferring evolutionary trees with strong combinatorial evidence
7. Time bounds for selection
8. A polynomial time algorithm for constructing the refined Buneman tree
9. The recovery of trees from measures of dissimilarity
10. Towards a theory of holistic clustering
11. A robust model for finding optimal evolutionary trees
12. A numerical approach to phylogenetic systematics
13. Hierarchial classification
14. Minimum spanning tree and single linkage cluster analysis
15. The complexity of finding generalized paths in tournaments
16. Disk-covering, a fast converging method for phylogenetic tree reconstruction
17. Towards a general theory of clustering
18. Sparsest cuts and bottlenecks in graphs
19. Retractions of finite distance functions onto tree metrics
20. Complexities of hierarchic clustering algorithms: State of the art
21. A reduction method for non-arithmetic data, and its application to thesauric translation
22. Algorithm 76: Hierarchical clustering using the minimum spanning tree
23. A statistical method for evaluating systematic relationships