Efficient algorithms for accurate hierarchical clustering of huge datasets: tackling the entire protein space

@article{citeulike:2966372, abstract = {Motivation: UPGMA (average linking) is probably the most popular algorithm for hierarchical data clustering, especially in computational biology. However, UPGMA requires the entire dissimilarity matrix in memory. Due to this prohibitive requirement, UPGMA is not scalable to very large datasets. Application: We present a novel class of memory-constrained UPGMA (MC-UPGMA) algorithms. Given any practical memory size constraint, this framework guarantees the correct clustering solution without explicitly requiring all dissimilarities in memory. The algorithms are general and are applicable to any dataset. We present a data-dependent characterization of hardness and clustering efficiency. The presented concepts are applicable to any agglomerative clustering formulation. Results: We apply our algorithm to the entire collection of protein sequences, to automatically build a comprehensive evolutionary-driven hierarchy of proteins from sequence alone. The newly created tree captures protein families better than state-of-the-art large-scale methods such as CluSTr, ProtoNet4 or single-linkage clustering. We demonstrate that leveraging the entire mass embodied in all sequence similarities allows to significantly improve on current protein family clusterings which are unable to directly tackle the sheer mass of this data. Furthermore, we argue that non-metric constraints are an inherent complexity of the sequence space and should not be overlooked. The robustness of UPGMA allows significant improvement, especially for multidomain proteins, and for large or divergent families. Availability: A comprehensive tree built from all UniProt sequence similarities, together with navigation and classification tools will be made available as part of the ProtoNet service. A C++ implementation of the algorithm is available on request. Contact: lonshy@cs.huji.ac.il 10.1093/bioinformatics/btn174}, author = {Loewenstein, Yaniv and Portugaly, Elon and Fromer, Menachem and Linial, Michal }, citeulike-article-id = {2966372}, doi = {http://dx.doi.org/10.1093/bioinformatics/btn174}, journal = {Bioinformatics}, keywords = {algorithm, clustering, toread}, month = {July}, number = {13}, pages = {i41--49}, posted-at = {2008-07-07 15:42:41}, priority = {2}, title = {Efficient algorithms for accurate hierarchical clustering of huge datasets: tackling the entire protein space}, url = {http://dx.doi.org/10.1093/bioinformatics/btn174}, volume = {24}, year = {2008} }

TY - JOUR ID - citeulike:2966372 L3 - citeulike-article-id:2966372 TI - Efficient algorithms for accurate hierarchical clustering of huge datasets: tackling the entire protein space JF - Bioinformatics VL - 24 IS - 13 SP - i41 EP - 49 N2 - Motivation: UPGMA (average linking) is probably the most popular algorithm for hierarchical data clustering, especially in computational biology. However, UPGMA requires the entire dissimilarity matrix in memory. Due to this prohibitive requirement, UPGMA is not scalable to very large datasets. Application: We present a novel class of memory-constrained UPGMA (MC-UPGMA) algorithms. Given any practical memory size constraint, this framework guarantees the correct clustering solution without explicitly requiring all dissimilarities in memory. The algorithms are general and are applicable to any dataset. We present a data-dependent characterization of hardness and clustering efficiency. The presented concepts are applicable to any agglomerative clustering formulation. Results: We apply our algorithm to the entire collection of protein sequences, to automatically build a comprehensive evolutionary-driven hierarchy of proteins from sequence alone. The newly created tree captures protein families better than state-of-the-art large-scale methods such as CluSTr, ProtoNet4 or single-linkage clustering. We demonstrate that leveraging the entire mass embodied in all sequence similarities allows to significantly improve on current protein family clusterings which are unable to directly tackle the sheer mass of this data. Furthermore, we argue that non-metric constraints are an inherent complexity of the sequence space and should not be overlooked. The robustness of UPGMA allows significant improvement, especially for multidomain proteins, and for large or divergent families. Availability: A comprehensive tree built from all UniProt sequence similarities, together with navigation and classification tools will be made available as part of the ProtoNet service. A C++ implementation of the algorithm is available on request. Contact: lonshy@cs.huji.ac.il 10.1093/bioinformatics/btn174 KW - algorithm KW - clustering KW - toread AU - Loewenstein, Yaniv AU - Portugaly, Elon AU - Fromer, Menachem AU - Linial, Michal PY - 2008/07/01/ UR - http://dx.doi.org/10.1093/bioinformatics/btn174 ER -