Evidence map›Paper›PMID 30340461›Full record

ArticleBMC bioinformatics2018

Using set theory to reduce redundancy in pathway sets.

Ruth Alexandra Stoney, Jean-Marc Schwartz, David L Robertson, Goran Nenadic

Abstract read
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
17citing 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

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

  1. Pooled it
  2. Article
  3. Article
  4. Pathway Analysis Interpretation in the Multi-Omic Era.Biotech (Basel (Switzerland)) · 2025
    Review
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Review
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. 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

4 authors.

Ruth Alexandra StoneySchool of Computer Science, University of Manchester, Manchester, M13 9PL, UK. ruth.stoney@manchester.ac.uk.ORCID http://orcid.org/0000-0002-8177-2584
Jean-Marc SchwartzSchool of Biological Sciences, University of Manchester, Manchester, M13 9PT, UK.ORCID http://orcid.org/0000-0002-6472-0184
David L RobertsonSchool of Biological Sciences, University of Manchester, Manchester, M13 9PT, UK.ORCID http://orcid.org/0000-0001-6338-0221
Goran NenadicSchool of Computer Science, University of Manchester, Manchester, M13 9PL, UK.ORCID http://orcid.org/0000-0003-0795-5363

Funding

Biotechnology and Biological Sciences Research Council BB/J014478/1Medical Research Council MC_UU_12014/12
6 · The paper itself

Abstract

backgroundThe consolidation of pathway databases, such as KEGG, Reactome and ConsensusPathDB, has generated widespread biological interest, however the issue of pathway redundancy impedes the use of these consolidated datasets. Attempts to reduce this redundancy have focused on visualizing pathway overlap or merging pathways, but the resulting pathways may be of heterogeneous sizes and cover multiple biological functions. Efforts have also been made to deal with redundancy in pathway data by consolidating enriched pathways into a number of clusters or concepts. We present an alternative approach, which generates pathway subsets capable of covering all of genes presented within either pathway databases or enrichment results, generating substantial reductions in redundancy.

resultsWe propose a method that uses set cover to reduce pathway redundancy, without merging pathways. The proposed approach considers three objectives: removal of pathway redundancy, controlling pathway size and coverage of the gene set. By applying set cover to the ConsensusPathDB dataset we were able to produce a reduced set of pathways, representing 100% of the genes in the original data set with 74% less redundancy, or 95% of the genes with 88% less redundancy. We also developed an algorithm to simplify enrichment data and applied it to a set of enriched osteoarthritis pathways, revealing that within the top ten pathways, five were redundant subsets of more enriched pathways. Applying set cover to the enrichment results removed these redundant pathways allowing more informative pathways to take their place.

conclusionOur method provides an alternative approach for handling pathway redundancy, while ensuring that the pathways are of homogeneous size and gene coverage is maximised. Pathways are not altered from their original form, allowing biological knowledge regarding the data set to be directly applicable. We demonstrate the ability of the algorithms to prioritise redundancy reduction, pathway size control or gene set coverage. The application of set cover to pathway enrichment results produces an optimised summary of the pathways that best represent the differentially regulated gene set.

Indexed as

AlgorithmsDatabases, GeneticGene Expression ProfilingHumansSignal TransductionData redundancyGene enrichment analysisPathwaysSet cover

Identifiers

PMID30340461
PMCPMC6194563

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.