Cargando…
Efficient algorithms for accurate hierarchical clustering of huge datasets: tackling the entire protein space
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. Appl...
Autores principales: | Loewenstein, Yaniv, Portugaly, Elon, Fromer, Menachem, Linial, Michal |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2008
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2718652/ https://www.ncbi.nlm.nih.gov/pubmed/18586742 http://dx.doi.org/10.1093/bioinformatics/btn174 |
Ejemplares similares
-
A computational framework to empower probabilistic protein design
por: Fromer, Menachem, et al.
Publicado: (2008) -
Assessment and improvement of the Plasmodium yoelii yoelii genome annotation through comparative analysis
por: Vaughan, Ashley, et al.
Publicado: (2008) -
Selecting anti-HIV therapies based on a variety of genomic and clinical factors
por: Rosen-Zvi, Michal, et al.
Publicado: (2008) -
Differential variability analysis of gene expression and its application to human diseases
por: Ho, Joshua W.K., et al.
Publicado: (2008) -
Reversible jump MCMC approach for peak identification for stroke SELDI mass spectrometry using mixture model
por: Wang, Yuan, et al.
Publicado: (2008)