Evidence map›Paper›PMID 25413493›Full record

ArticleBMC bioinformatics2014

A fast algorithm for determining bounds and accurate approximate p-values of the rank product statistic for replicate experiments.

Tom Heskes, Rob Eisinga, Rainer Breitling

Abstract read
In one paragraph

Article in BMC bioinformatics, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 23 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
23citing papers in PubMed, 1 pooled it
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

23 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. The Transcriptional Landscape ofInternational journal of molecular sciences · 2022
    Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Tom HeskesInstitute for Computing and Information Sciences, Radboud University Nijmegen, Nijmegen, The Netherlands. t.heskes@science.ru.nl.
Rob EisingaDepartment of Social Science Research Methods, Radboud University Nijmegen, Nijmegen, The Netherlands. r.eisinga@maw.ru.nl.
Rainer BreitlingManchester Institute of Biotechnology, Faculty of Life Sciences, University of Manchester, Manchester, UK. rainer.breitling@manchester.ac.uk.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundThe rank product method is a powerful statistical technique for identifying differentially expressed molecules in replicated experiments. A critical issue in molecule selection is accurate calculation of the p-value of the rank product statistic to adequately address multiple testing. Both exact calculation and permutation and gamma approximations have been proposed to determine molecule-level significance. These current approaches have serious drawbacks as they are either computationally burdensome or provide inaccurate estimates in the tail of the p-value distribution.

resultsWe derive strict lower and upper bounds to the exact p-value along with an accurate approximation that can be used to assess the significance of the rank product statistic in a computationally fast manner. The bounds and the proposed approximation are shown to provide far better accuracy over existing approximate methods in determining tail probabilities, with the slightly conservative upper bound protecting against false positives. We illustrate the proposed method in the context of a recently published analysis on transcriptomic profiling performed in blood.

conclusionsWe provide a method to determine upper bounds and accurate approximate p-values of the rank product statistic. The proposed algorithm provides an order of magnitude increase in throughput as compared with current approaches and offers the opportunity to explore new application domains with even larger multiple testing issue. The R code is published in one of the Additional files and is available at http://www.ru.nl/publish/pages/726696/rankprodbounds.zip .

Indexed as

AlgorithmsAgingBiomarkersDatabases, GeneticGene Expression ProfilingHumansProbabilityBiomarkers

Identifiers

PMID25413493
PMCPMC4245829

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.