Using set theory to reduce redundancy in pathway sets
Ruth StoneyiD, Jean‐Marc SchwartziD, David L. RobertsoniD, Goran NenadićiD
Abstract
1.1.01 BackgroundThe consolidation of pathway databases, such as KEGG[1], Reactome[2]and ConsensusPathDB[3], 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.\n\n1.02 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.\n\n1.03 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.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 28
- FWCI
- 1.24
- Field percentile
- top 21%
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- DecoPath: A web application for decoding pathway enrichment analysis
Sarah Mubeen, Vinay Srinivas Bharadhwaj, … Daniel Domingo‐Fernándéz·NAR Genomics and BioinformaticsPeer-reviewed·Jun 23, 2021
- PathMe: Merging and exploring mechanistic pathway knowledge
Daniel Domingo‐Fernándéz, Sarah Mubeen, … Martin Hofmann‐Apitius·BMC BioinformaticsPeer-reviewed·May 15, 2019
- ComPath: An ecosystem for exploring, analyzing, and curating mappings across pathway databases
Daniel Domingo‐Fernándéz, Charles Tapley Hoyt, … Martin Hofmann‐Apitius·npj Systems Biology and ApplicationsPeer-reviewed·Dec 6, 2018
- The Impact of Pathway Database Choice on Statistical Enrichment Analysis and Predictive Modeling
Sarah Mubeen, Charles Tapley Hoyt, … Daniel Domingo‐Fernándéz·Frontiers in GeneticsPeer-reviewed·Nov 22, 2019
- CLEAR: Concise List Enrichment Analysis Reducing Redundancy
Xinglin Jia, An Phan, … Claus Kadelka·bioRxiv·Apr 2, 2026
- Coherent pathway enrichment estimation by modeling inter-pathway dependencies using regularized regression
Kim Philipp Jablonski, Niko Beerenwinkel·BioinformaticsPeer-reviewed·Aug 1, 2023