Redundancy-aware unsupervised ranking based on game theory -- application to gene enrichment analysis

• URL: http://arxiv.org/abs/2207.12184v1
• Date: Fri, 22 Jul 2022 08:57:08 GMT
• Title: Redundancy-aware unsupervised ranking based on game theory -- application to gene enrichment analysis
• Authors: Chiara Balestra, Carlo Maj, Emmanuel Mueller, Andreas Mayr
• Abstract summary: We propose a method to rank sets within a family of sets based on the distribution of the singletons and their size. We evaluate our approach for gene sets collections; the rankings obtained show low redundancy and high coverage of the genes.
• Score: 0.28675177318965034
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Gene set collections are a common ground to study the enrichment of genes for specific phenotypic traits. Gene set enrichment analysis aims to identify genes that are over-represented in gene sets collections and might be associated with a specific phenotypic trait. However, as this involves a massive number of hypothesis testing, it is often questionable whether a pre-processing step to reduce gene sets collections' sizes is helpful. Moreover, the often highly overlapping gene sets and the consequent low interpretability of gene sets' collections demand for a reduction of the included gene sets. Inspired by this bioinformatics context, we propose a method to rank sets within a family of sets based on the distribution of the singletons and their size. We obtain sets' importance scores by computing Shapley values without incurring into the usual exponential number of evaluations of the value function. Moreover, we address the challenge of including a redundancy awareness in the rankings obtained where, in our case, sets are redundant if they show prominent intersections. We finally evaluate our approach for gene sets collections; the rankings obtained show low redundancy and high coverage of the genes. The unsupervised nature of the proposed ranking does not allow for an evident increase in the number of significant gene sets for specific phenotypic traits when reducing the size of the collections. However, we believe that the rankings proposed are of use in bioinformatics to increase interpretability of the gene sets collections and a step forward to include redundancy into Shapley values computations.

Related papers

• Beyond Independent Genes: Learning Module-Inductive Representations for Gene Perturbation Prediction [48.80217316452559]
  scBIG is a module-inductive prediction framework that explicitly models coordinated gene programs.<n> scBIG consistently outperforms state-of-the-art methods, particularly on unseen and perturbation settings.
  arXiv  Detail & Related papers  (2026-02-03T16:43:40Z)
• You Only Train Once: Differentiable Subset Selection for Omics Data [16.72884554628602]
  YOTO is an end-to-end framework that jointly identifies discrete gene subsets and performs prediction within a single differentiable architecture.<n>We evaluate YOTO on two representative single-cell RNA-seq datasets, showing that it consistently outperforms state-of-the-art baselines.
  arXiv  Detail & Related papers  (2025-12-19T15:17:34Z)
• Auxiliary Gene Learning: Spatial Gene Expression Estimation by Auxiliary Gene Selection [7.959841510571622]
  We propose $Auxiliary Gene Learning$ (AGL) that utilizes the benefit of the ignored genes by reformulating their expression estimation as auxiliary tasks.<n>To effectively leverage auxiliary genes, we must select a subset of auxiliary genes that positively influence the prediction of the target genes.<n>The experiments confirm the effectiveness of incorporating auxiliary genes and show that the proposed method outperforms conventional auxiliary task learning approaches.
  arXiv  Detail & Related papers  (2025-11-23T08:22:20Z)
• Unlasting: Unpaired Single-Cell Multi-Perturbation Estimation by Dual Conditional Diffusion Implicit Bridges [68.98973318553983]
  We propose a framework based on Dual Diffusion Implicit Bridges (DDIB) to learn the mapping between different data distributions.<n>We integrate gene regulatory network (GRN) information to propagate perturbation signals in a biologically meaningful way.<n>We also incorporate a masking mechanism to predict silent genes, improving the quality of generated profiles.
  arXiv  Detail & Related papers  (2025-06-26T09:05:38Z)
• GRAPE: Heterogeneous Graph Representation Learning for Genetic Perturbation with Coding and Non-Coding Biotype [51.58774936662233]
  Building gene regulatory networks (GRN) is essential to understand and predict the effects of genetic perturbations.<n>In this work, we leverage pre-trained large language model and DNA sequence model to extract features from gene descriptions and DNA sequence data.<n>We introduce gene biotype information for the first time in genetic perturbation, simulating the distinct roles of genes with different biotypes in regulating cellular processes.
  arXiv  Detail & Related papers  (2025-05-06T03:35:24Z)
• Learning to Discover Regulatory Elements for Gene Expression Prediction [59.470991831978516]
  Seq2Exp is a Sequence to Expression network designed to discover and extract regulatory elements that drive target gene expression. Our approach captures the causal relationship between epigenomic signals, DNA sequences and their associated regulatory elements.
  arXiv  Detail & Related papers  (2025-02-19T03:25:49Z)
• BOLIMES: Boruta and LIME optiMized fEature Selection for Gene Expression Classification [0.0937465283958018]
  BOLIMES is a novel feature selection algorithm designed to enhance gene expression classification. It combines exhaustive feature selection with interpretability-driven refinement, offering a powerful solution for high-dimensional gene expression analysis.
  arXiv  Detail & Related papers  (2025-02-18T17:33:41Z)
• GENERator: A Long-Context Generative Genomic Foundation Model [66.46537421135996]
  We present GENERator, a generative genomic foundation model featuring a context length of 98k base pairs (bp) and 1.2B parameters. Trained on an expansive dataset comprising 386B bp of DNA, the GENERator demonstrates state-of-the-art performance across both established and newly proposed benchmarks. It also shows significant promise in sequence optimization, particularly through the prompt-responsive generation of enhancer sequences with specific activity profiles.
  arXiv  Detail & Related papers  (2025-02-11T05:39:49Z)
• Survey and Improvement Strategies for Gene Prioritization with Large Language Models [61.24568051916653]
  Large language models (LLMs) have performed well in medical exams, but their effectiveness in diagnosing rare genetic diseases has not been assessed. We used multi-agent and Human Phenotype Ontology (HPO) classification to categorized patients based on phenotypes and solvability levels. At baseline, GPT-4 outperformed other LLMs, achieving near 30% accuracy in ranking causal genes correctly.
  arXiv  Detail & Related papers  (2025-01-30T23:03:03Z)
• Cross-Attention Graph Neural Networks for Inferring Gene Regulatory Networks with Skewed Degree Distribution [9.919024883502322]
  Cross-Attention Complex Dual Graph Embedding Model (XATGRN) Our model consistently outperforms existing state-of-the-art methods across various datasets.
  arXiv  Detail & Related papers  (2024-12-18T10:56:40Z)
• GeneQuery: A General QA-based Framework for Spatial Gene Expression Predictions from Histology Images [41.732831871866516]
  Whole-slide hematoxylin and eosin stained histological images are readily accessible and allow for detailed examinations of tissue structure and composition at the microscopic level. Recent advancements have utilized these histological images to predict spatially resolved gene expression profiles. GeneQuery aims to solve this gene expression prediction task in a question-answering (QA) manner for better generality and flexibility.
  arXiv  Detail & Related papers  (2024-11-27T14:33:13Z)
• Semantically Rich Local Dataset Generation for Explainable AI in Genomics [0.716879432974126]
  Black box deep learning models trained on genomic sequences excel at predicting the outcomes of different gene regulatory mechanisms. We propose using Genetic Programming to generate datasets by evolving perturbations in sequences that contribute to their semantic diversity.
  arXiv  Detail & Related papers  (2024-07-03T10:31:30Z)
• Predicting Genetic Mutation from Whole Slide Images via Biomedical-Linguistic Knowledge Enhanced Multi-label Classification [119.13058298388101]
  We develop a Biological-knowledge enhanced PathGenomic multi-label Transformer to improve genetic mutation prediction performances. BPGT first establishes a novel gene encoder that constructs gene priors by two carefully designed modules. BPGT then designs a label decoder that finally performs genetic mutation prediction by two tailored modules.
  arXiv  Detail & Related papers  (2024-06-05T06:42:27Z)
• VQDNA: Unleashing the Power of Vector Quantization for Multi-Species Genomic Sequence Modeling [60.91599380893732]
  VQDNA is a general-purpose framework that renovates genome tokenization from the perspective of genome vocabulary learning. By leveraging vector-quantized codebooks as learnable vocabulary, VQDNA can adaptively tokenize genomes into pattern-aware embeddings.
  arXiv  Detail & Related papers  (2024-05-13T20:15:03Z)
• Single-Cell Deep Clustering Method Assisted by Exogenous Gene Information: A Novel Approach to Identifying Cell Types [50.55583697209676]
  We develop an attention-enhanced graph autoencoder, which is designed to efficiently capture the topological features between cells. During the clustering process, we integrated both sets of information and reconstructed the features of both cells and genes to generate a discriminative representation. This research offers enhanced insights into the characteristics and distribution of cells, thereby laying the groundwork for early diagnosis and treatment of diseases.
  arXiv  Detail & Related papers  (2023-11-28T09:14:55Z)
• Redundancy-aware unsupervised rankings for collections of gene sets [0.28675177318965034]
  We propose to use importance scores to rank the pathways in the collections studying the context from a set covering perspective. The proposed method shows a practical utility in bioinformatics to increase the interpretability of the collections of gene sets.
  arXiv  Detail & Related papers  (2023-07-30T09:39:42Z)
• Feature extraction using Spectral Clustering for Gene Function Prediction [0.4492444446637856]
  This paper presents a novel in silico approach for to the annotation problem that combines cluster analysis and hierarchical multi-label classification. The proposed approach is applied to a case study on Zea mays, one of the most dominant and productive crops in the world.
  arXiv  Detail & Related papers  (2022-03-25T10:17:36Z)
• Multi-modal Self-supervised Pre-training for Regulatory Genome Across Cell Types [75.65676405302105]
  We propose a simple yet effective approach for pre-training genome data in a multi-modal and self-supervised manner, which we call GeneBERT. We pre-train our model on the ATAC-seq dataset with 17 million genome sequences.
  arXiv  Detail & Related papers  (2021-10-11T12:48:44Z)
• Mining Functionally Related Genes with Semi-Supervised Learning [0.0]
  We introduce a rich set of features and use them in conjunction with semisupervised learning approaches. The framework of learning with positive and unlabeled examples (LPU) is shown to be especially appropriate for mining functionally related genes.
  arXiv  Detail & Related papers  (2020-11-05T20:34:09Z)
• Identifying Stress Responsive Genes using Overlapping Communities in Co-expression Networks [0.0]
  The paper proposes a workflow to identify genes that respond to specific treatments in plants. The workflow is applied to rice (Oryza sativa), a major food source known to be highly sensitive to salt stress.
  arXiv  Detail & Related papers  (2020-10-23T21:14:59Z)
• A Novel Granular-Based Bi-Clustering Method of Deep Mining the Co-Expressed Genes [76.84066556597342]
  Bi-clustering methods are used to mine bi-clusters whose subsets of samples (genes) are co-regulated under their test conditions. Unfortunately, traditional bi-clustering methods are not fully effective in discovering such bi-clusters. We propose a novel bi-clustering method by involving here the theory of Granular Computing.
  arXiv  Detail & Related papers  (2020-05-12T02:04:40Z)
• Learn to Predict Sets Using Feed-Forward Neural Networks [63.91494644881925]
  This paper addresses the task of set prediction using deep feed-forward neural networks. We present a novel approach for learning to predict sets with unknown permutation and cardinality. We demonstrate the validity of our set formulations on relevant vision problems.
  arXiv  Detail & Related papers  (2020-01-30T01:52:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.