Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

36912 · May 202019922001200920172026
48 results for gene co-expression

Bayesian methods detect clusters in noisy data more reliably.

problem Noisy data distorts traditional clustering methods, leading to unreliable results.
method Bayesian community detection using Minimum Description Length principle.
result Bayesian methods identify more robust clusters in noisy data.

We study the challenges of applying deep learning to gene expression data. We find experimentally that there exists non-linear signal in the data, however is it not discovered automatically given the noise and low numbers of samples used in most research. We discuss how gene interaction graphs (same pathway, protein-pr…

2018-06-18abs ↗pdf ↗

Most network-based protein (or gene) function prediction methods are based on the assumption that the labels of two adjacent proteins in the network are likely to be the same. However, assuming the pairwise relationship between proteins or genes is not complete, the information a group of genes that show very similar p…

2012-12-03abs ↗pdf ↗

The paper develops a test for independence of selected Gaussian variables after thresholding correlations.

problem Testing independence of selected Gaussian variables after thresholding correlations.
method The approach involves conditioning on the selection event and using a new characterization of the conditioning event in terms of canonical correlation.
result The proposed test has higher power than a naive approach that ignores selection effects.

Spectral sparsification improves Gaussian graphical models under MTP2 constraints.

problem Learning accurate, sparse graphs from data under MTP2 constraints.
method Spectral graph sparsification applied to Gaussian graphical models.
result Spectral-MTP2 preserves MTP2 and approximates the original model well.

In the biclustering problem, we seek to simultaneously group observations and features. While biclustering has applications in a wide array of domains, ranging from text mining to collaborative filtering, the problem of identifying structure in high dimensional genomic data motivates this work. In this context, biclust…

2014-08-05abs ↗pdf ↗

A new multi-task learning estimator improves Gaussian graphical regression model fitting.

problem High error rate in fitting Gaussian graphical regression models due to separate node-wise lasso regressions.
method Proposes a multi-task learning estimator with cross-task group sparsity and within-task element-wise sparsity penalties, solved via an efficient augmented Lagrangian algorithm.
result Error rate improvement over separate node-wise lasso estimates, demonstrated through simulations and application to gene co-expression network study.

VEGN uses graph neural networks to predict disease-causing mutations from genetic variants.

problem Identifying disease-causing mutations from millions of genetic variants.
method VEGN employs a graph neural network on a heterogeneous graph of genes and variants, learning gene-gene interactions.
result VEGN outperforms existing state-of-the-art models in variant effect prediction.

Identifying significant subsets of the genes, gene shaving is an essential and challenging issue for biomedical research for a huge number of genes and the complex nature of biological networks,. Since positive definite kernel based methods on genomic information can improve the prediction of diseases, in this paper we…

2018-09-05abs ↗pdf ↗

A new method for joint eQTL mapping and gene network estimation.

problem Discovering SNP-gene relationships and gene-gene relationships in gene expression regulation.
method L1-2 regularized multi-task graphical lasso (L1-2 GLasso).
result Competitive performance on capturing true sparse structures of eQTL mapping and gene network.

A novel method selects genes for high-dimensional gene expression data with class imbalance.

problem Class imbalance in gene expression datasets.
method Synthetic data balancing, greedy search, weighted robust score.
result The proposed method outperforms existing feature selection procedures.

The problem of multilabel classification when the labels are related through a hierarchical categorization scheme occurs in many application domains such as computational biology. For example, this problem arises naturally when trying to automatically assign gene function using a controlled vocabularies like Gene Ontol…

2012-05-09abs ↗pdf ↗

The method integrates survival constraints into NMF for identifying survival-associated gene clusters.

problem Understanding and interpreting high-dimensional biological data for disease markers.
method Cox proportional hazards regression integrated with NMF via proportional hazards non-negative matrix factorization.
result The method can uncover survival-associated gene clusters in cancer gene expression data.

New methods detect continuous variation in single-cell data.

problem Continuous variation within and between cell types not detected by discrete analyses.
method Three topologically motivated mathematical methods for unsupervised feature selection.
result Detect additional biologically meaningful genes with coherent expression patterns.

New gene selection method improves tumor classification accuracy.

problem Efficiently selecting relevant genes from high-dimensional tumor gene expression data.
method Fuzzy-Rough Set Theory for feature dependency analysis.
result The proposed method outperforms state-of-the-art techniques in tumor classification.

New model generates realistic single-cell gene expression data.

problem Generating realistic single-cell gene expression profiles is challenging.
method scLDM, a latent diffusion model using Diffusion Transformers and linear interpolants.
result Superior performance in generating realistic single-cell gene expression data.

We address the problem of synthetic gene design using Bayesian optimization. The main issue when designing a gene is that the design space is defined in terms of long strings of characters of different lengths, which renders the optimization intractable. We propose a three-step approach to deal with this issue. First, …

2015-05-07abs ↗pdf ↗

InfoSEM infers gene regulatory networks without GT labels, improving performance.

problem Inferring GRNs from gene expression data with high accuracy and avoiding biases.
method InfoSEM uses deep generative models with informative priors (textual gene embeddings).
result InfoSEM outperforms existing models by 38.5% across four datasets.

Stem uses diffusion models to infer gene expression from H&E images.

problem Inference of gene expression from H&E stained images is time-consuming and expensive.
method Conditional diffusion generative model to infer gene expression.
result Stem achieves state-of-the-art performance in spatial gene expression prediction.

Unified framework improves gene prioritization in disease studies.

problem Identifying genes involved in diseases using heterogeneous biological data.
method Network propagation-based gene prioritization with integrated biological information.
result Significant improvements in prioritizing genes not identified by traditional methods.

Study identifies cancer genes through graph anomaly analysis of protein interactions.

problem Insufficient modeling of biological information in protein interaction networks for cancer gene identification.
method Proposes HIerarchical-Perspective Graph Neural Network (HIPGNN) to detect weight heterogeneity and spectral flattening in cancer gene nodes.
result HIPGNN detects weight heterogeneity and spectral flattening, leading to improved cancer gene identification.