ArticleBMC bioinformatics2012
A systematic comparison of genome-scale clustering algorithms.
Article in BMC bioinformatics, 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 28 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
28 citing papers in PubMed.
- VesiclePy: A machine learning vesicle analysis toolbox for volume electron microscopy.PLoS computational biology · 2026Article
- Association of Seasonal Hyperacute Panuveitis Syndrome withOphthalmology science · 2026Article
- Exploration of schizophrenia-associated gene modules using graph theory, co-expression networks, and dimensionality reduction.PloS one · 2026Article
- Association of whole-person eigen-polygenic risk scores with Alzheimer's disease.Human molecular genetics · 2024Article
- A Comparative Study of Gene Co-Expression Thresholding Algorithms.Journal of computational biology : a journal of computational molecular cell biology · 2024Article
- Seminar: Scalable Preprocessing Tools for Exposomic Data Analysis.Environmental health perspectives · 2023Article
- Machine Learning Prediction of Adenovirus D8 Conjunctivitis Complications from Viral Whole-Genome Sequence.Ophthalmology science · 2022Article
- Article
- Article
- Molecular Subtyping and Outlier Detection in Human Disease Using the Paraclique Algorithm.Algorithms · 2021Article
- Genomic Metrics Applied toFrontiers in microbiology · 2021Article
- Genetic Diversity AmongFrontiers in microbiology · 2020Article
- A robustness metric for biological data clustering algorithms.BMC bioinformatics · 2019Article
- SNP variable selection by generalized graph domination.PloS one · 2019Article
- Comprehensive evaluation of RNA-seq analysis pipelines in diploid and polyploid species.GigaScience · 2018Article
- Microgeographic Proteomic Networks of the Human Colonic Mucosa and Their Association With Inflammatory Bowel Disease.Cellular and molecular gastroenterology and hepatology · 2016Article
- Lower Bounds on Paraclique Density.Discrete applied mathematics (Amsterdam, Netherlands : 1988) · 2016Article
- A New Strategy to Evaluate Technical Efficiency in Hospitals Using Homogeneous Groups of Casemix : How to Evaluate When There is Not DRGs?Journal of medical systems · 2016Article
- A novel approach identifies the first transcriptome networks in bats: a new genetic model for vocal communication.BMC genomics · 2015Article
- Cosplicing network analysis of mammalian brain RNA-Seq data utilizing WGCNA and Mantel correlations.Frontiers in genetics · 2015Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
9 authors.
Funding
Abstract
backgroundA wealth of clustering algorithms has been applied to gene co-expression experiments. These algorithms cover a broad range of approaches, from conventional techniques such as k-means and hierarchical clustering, to graphical approaches such as k-clique communities, weighted gene co-expression networks (WGCNA) and paraclique. Comparison of these methods to evaluate their relative effectiveness provides guidance to algorithm selection, development and implementation. Most prior work on comparative clustering evaluation has focused on parametric methods. Graph theoretical methods are recent additions to the tool set for the global analysis and decomposition of microarray co-expression matrices that have not generally been included in earlier methodological comparisons. In the present study, a variety of parametric and graph theoretical clustering algorithms are compared using well-characterized transcriptomic data at a genome scale from Saccharomyces cerevisiae.
methodsFor each clustering method under study, a variety of parameters were tested. Jaccard similarity was used to measure each cluster's agreement with every GO and KEGG annotation set, and the highest Jaccard score was assigned to the cluster. Clusters were grouped into small, medium, and large bins, and the Jaccard score of the top five scoring clusters in each bin were averaged and reported as the best average top 5 (BAT5) score for the particular method.
resultsClusters produced by each method were evaluated based upon the positive match to known pathways. This produces a readily interpretable ranking of the relative effectiveness of clustering on the genes. Methods were also tested to determine whether they were able to identify clusters consistent with those identified by other clustering methods.
conclusionsValidation of clusters against known gene classifications demonstrate that for this data, graph-based techniques outperform conventional clustering approaches, suggesting that further development and application of combinatorial strategies is warranted.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.