Optimal implementations of UPGMA and other common clustering algorithms
References (20)
- et al.
A novel parallelization approach for hierarchical clustering
Parallel Comput.
(2005) The complexity of ultrametric partitions on graphs
Inform. Process. Lett.
(1988)Parallel algorithms for hierarchical clustering
Parallel Comput.
(1995)- et al.
Accelerating phylogenetics computing on the desktop: experiments with executing UPGMA in programmable logic
- et al.
Trees and Proximities Representations
(1991) Construction d'une classification ascendante hiérarchique par la recherche en chaîne des voisins réciproques
Les Cahiers de l'Analyse des Données
(1982)- et al.
Efficient algorithms for agglomerative hierarchical clustering methods
J. of Classification
(1984) - C. Ding, X. He, Cluster aggregate inequality and multi-level hierarchical clustering, in: European Conference on...
- R. Edgar, MUSCLE: multiple sequence alignment with high accuracy and high throughput, Nucl. Acids Res. 32...
- et al.
Fast neighbor joining
There are more references available in the full text version of this article.
Cited by (151)
Possible functional proximity of various organisms based on the bioinformatics analysis of their taste receptors
2022, International Journal of Biological MacromoleculesCitation Excerpt :In finding correlation between all possible pair of significant features (for each Type), Pearson correlation coefficients were computed. UPGMA (unweighted pair group method with arithmetic mean), an agglomerative hierarchical clustering method was deployed to cluster (circular phylogram) various organisms, based on distance matrix formed by several features from taste receptor sequences [50,51]. Following two definitions were given to clarify the clustering of organisms.
Machine learning based lineage tree reconstruction improved with knowledge of higher level relationships between cells and genomic barcodes
2023, NAR Genomics and Bioinformatics
Copyright © 2007 Elsevier B.V. All rights reserved.