The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A comparative analysis of biclustering algorithms for gene expression data
Open accessAbstract
The need to analyze high-dimension biological data is driving the development of new data mining methods. Biclustering algorithms have been successfully applied to gene expression data to discover local patterns, in which a subset of genes exhibit similar expression levels over a subset of conditions. However, it is not clear which algorithms are best suited for this task. Many algorithms have been published in the past decade, most of which have been compared only to a small number of algorithms. Surveys and comparisons exist in the literature, but because of the large number and variety of biclustering algorithms, they are quickly outdated. In this article we partially address this problem of evaluating the strengths and weaknesses of existing biclustering methods. We used the BiBench package to compare 12 algorithms, many of which were recently published or have not been extensively studied. The algorithms were tested on a suite of synthetic data sets to measure their performance on data with varying conditions, such as different bicluster models, varying noise, varying numbers of biclusters and overlapping biclusters. The algorithms were also tested on eight large gene expression data sets obtained from the Gene Expression Omnibus. Gene Ontology enrichment analysis was performed on the resulting biclusters, and the best enrichment terms are reported. Our analyses show that the biclustering method and its parameters should be selected based on the desired model, whether that model allows overlapping biclusters, and its robustness to noise. In addition, we observe that the biclustering algorithms capable of finding more than one model are more successful at capturing biologically relevant clusters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gene Expression Omnibus: NCBI gene expression and hybridization array data repository
Edgar, R. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.207 · Cited by 13,288
More powerful procedures for multiple significance testing
Hochberg, Y., & Benjamini, Y. (1990) · Statistics in Medicine · doi:10.1002/sim.4780090710 · Cited by 2,715
Cited by
A hybrid feature selection algorithm for gene expression data classification
Lu, H., Chen, J., Yan, K., Jin, Q., Xue, Y., & Gao, Z. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.07.080 · Cited by 354
A comprehensive evaluation of module detection methods for gene expression data
Saelens, W., Cannoodt, R., & Saeys, Y. (2018) · Nature Communications · doi:10.1038/s41467-018-03424-4 · Cited by 311
Biclustering on expression data: A review
Pontes, B., Giráldez, R., & Aguilar-Ruiz, J. S. (2015) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2015.06.028 · Cited by 256
Biclustering Methods: Biological Relevance and Application in Gene Expression Analysis
Oghabian, A., Kilpinen, S., Hautaniemi, S., & Czeizler, E. (2014) · PLoS ONE · doi:10.1371/journal.pone.0090801 · Cited by 88
Analysis of miRNA expression profiles in breast cancer using biclustering
Fiannaca, A., La Rosa, M., La Paglia, L., Rizzo, R., & Urso, A. (2015) · BMC Bioinformatics · doi:10.1186/1471-2105-16-s4-s7 · Cited by 45
Metadata
- Authors
- Eren, K., Deveci, M., Kucuktunc, O., & Catalyurek, U. V.
- Venue
- Briefings in Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2012-07-06
- Volume
- 14
- Issue
- 3
- Pages
- 279-292
- ISSN
- 1467-5463 (ISSN-L)
- 1477-4054
- OpenAlex
- W2169387435
- Cited by
- 229
- References
- 2
- FWCI
- 6.74
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A comparative analysis of biclustering algorithms for gene expression data. https://app.cochat.ai/papers/10.1093/bib/bbs032
- The paper
- Eren, K., Deveci, M., Kucuktunc, O., & Catalyurek, U. V. (2013). A comparative analysis of biclustering algorithms for gene expression data. Briefings in Bioinformatics. https://doi.org/10.1093/bib/bbs032
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.