Optimal implementations of UPGMA and other common clustering algorithms
From MaRDI portal
Publication:2380024
DOI10.1016/j.ipl.2007.07.002zbMath1184.68600MaRDI QIDQ2380024
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.07.002
computational complexity; hierarchical clustering; design of algorithms; UPGMA; input-output specification
Related Items
Unnamed Item, An overview of multiple sequence alignments and cloud computing in bioinformatics, Analysing microarray expression data through effective clustering, Magnus representation of genome sequences, On-line CAD Reconstruction with Accumulated Means of Local Geometric Properties
Uses Software
Cites Work
- Parallel algorithms for hierarchical clustering
- Efficient algorithms for agglomerative hierarchical clustering methods
- The complexity of ultrametric partitions on graphs
- Data Integration in the Life Sciences
- Fast hierarchical clustering and other applications of dynamic closest pairs
- Automata, Languages and Programming
- Webmining: learning from the world wide web.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item