The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Stability and aggregation of ranked gene lists
Open accessAbstract
Ranked gene lists are highly instable in the sense that similar measures of differential gene expression may yield very different rankings, and that a small change of the data set usually affects the obtained gene list considerably. Stability issues have long been under-considered in the literature, but they have grown to a hot topic in the last few years, perhaps as a consequence of the increasing skepticism on the reproducibility and clinical applicability of molecular research findings. In this article, we review existing approaches for the assessment of stability of ranked gene lists and the related problem of aggregation, give some practical recommendations, and warn against potential misuse of these methods. This overview is illustrated through an application to a recent leukemia data set using the freely available Bioconductor package GeneSelector.
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
Smyth, G. K. (2004) · Statistical Applications in Genetics and Molecular Biology · doi:10.2202/1544-6115.1027 · Cited by 11,829
Why Most Published Research Findings Are False
Ioannidis, J. P. A. (2005) · PLoS Medicine · doi:10.1371/journal.pmed.0020124 · Cited by 10,505
Why Most Published Research Findings Are False
Ioannidis, J. P. A. (2005) · CHANCE · doi:10.1080/09332480.2005.10722754 · Cited by 4,702 · cited 2×
“We actually believe that stability issues will gain much attention in future biomedical research, because they are tightly connected to the problem of ”fishing for significance” and ”false research findings” [18] in several respects.”
BackgroundMicroarray data analysis: from disarray to consolidation and consensus
Allison, D. B., Cui, X., Page, G. P., & Sabripour, M. (2006) · Nature Reviews Genetics · doi:10.1038/nrg1749 · Cited by 1,339 · cited 1×
“Such strategies have often been used to study the stability of gene rankings [22, 23, 24, 25, 26, 27, 28, 29].”
Multiple-laboratory comparison of microarray platforms
Irizarry, R. A., Warren, D., Spencer, F., Kim, I. F., Biswal, S., Frank, B. C., Gabrielson, E., Garcia, J. G. N., Geoghegan, J., Germino, G., et al. (2005) · Nature Methods · doi:10.1038/nmeth756 · Cited by 862
Discovering motifs in ranked lists of DNA sequences
Eden, E., Lipson, D., Yogev, S., & Yakhini, Z. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030039 · Cited by 696
Cited by
Ranking treatments in frequentist network meta-analysis works without resampling methods
Rücker, G., & Schwarzer, G. (2015) · BMC Medical Research Methodology · doi:10.1186/s12874-015-0060-8 · Cited by 1,732
Robust rank aggregation for gene list integration and meta-analysis
Kolde, R., Laur, S., Adler, P., & Vilo, J. (2012) · Bioinformatics · doi:10.1093/bioinformatics/btr709 · Cited by 1,191
Measuring reproducibility of high-throughput experiments
Li, Q., Brown, J. B., Huang, H., & Bickel, P. J. (2011) · The Annals of Applied Statistics · doi:10.1214/11-aoas466 · Cited by 1,009
Evaluation of variable selection methods for random forests and omics data sets
Degenhardt, F., Seifert, S., & Szymczak, S. (2019) · Briefings in Bioinformatics · doi:10.1093/bib/bbx124 · Cited by 724
A survey on filter techniques for feature selection in gene expression microarray analysis
Lazar, C., Taminau, J., Meganck, S., Steenhoff, D., Coletta, A., Molter, C., de Schaetzen, V., Duque, R., Bersini, H., & Nowe, A. (2012) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2012.33 · Cited by 619
Metadata
- Authors
- Boulesteix, A.-L., & Slawski, M.
- Venue
- Briefings in Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2009-08-07
- Volume
- 10
- Issue
- 5
- Pages
- 556-568
- ISSN
- 1467-5463 (ISSN-L)
- 1477-4054
- OpenAlex
- W2151990594
- Cited by
- 177
- References
- 6
- FWCI
- 6.00
- 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: Stability and aggregation of ranked gene lists. https://app.cochat.ai/papers/10.1093/bib/bbp034
- The paper
- Boulesteix, A.-L., & Slawski, M. (2009). Stability and aggregation of ranked gene lists. Briefings in Bioinformatics. https://doi.org/10.1093/bib/bbp034
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.