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,694 papers · 148 categories

Trend · papers per month

306191121 · Jun 202019922001200920172026
48 results for single-cell gene expression

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.

MarkerMap selects key genes for cell type analysis in single-cell RNA-seq.

problem Selecting informative genes from large single-cell RNA-seq datasets is challenging and computationally intensive.
method MarkerMap is a generative model that identifies minimal gene sets explaining cell type variability.
result MarkerMap outperforms existing methods in both supervised and unsupervised marker selection.

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.

Single-cell gene expression data provide invaluable resources for systematic characterization of cellular hierarchy in multi-cellular organisms. However, cell lineage reconstruction is still often associated with significant uncertainty due to technological constraints. Such uncertainties have not been taken into accou…

2016-01-12abs ↗pdf ↗

A comprehensive benchmark of 15 scRNA-seq imputation methods across various datasets and analyses.

problem Imputation of single-cell RNA sequencing data to recover latent transcriptional signals.
method Evaluation of 15 imputation methods across 30 datasets and 6 downstream analyses.
result Traditional methods generally outperform DL-based methods in scRNA-seq data analysis.

The paper improves Fisher-Pitman tests for Poisson mixtures, detecting autism-related genes.

problem Detecting differentially expressed genes between autism and control subjects.
method Nonparametric Poisson mixtures and Fisher-Pitman permutation tests.
result The tests reveal genes missed by common methods, demonstrating rate optimality.

The paper develops methods for causal inference from single-cell RNA sequencing data with multiple outcomes.

problem Causal inference from single-cell RNA sequencing data with multiple heterogeneous outcomes.
method Generic semiparametric inference framework for doubly robust estimation with multiple derived outcomes.
result Demonstrates the use of semiparametric inferential results for estimating causal effects in genomics.

The paper proposes a method to infer differentiation trees from RNA velocity data.

problem Reconstructing dynamic cellular processes from sequencing data.
method Defining varifold distances between RNA velocity curves to approximate shortest-path distances in a tree.
result The varifold distance method approximates the shortest-path distance in a tree isomorphic to the target differentiation tree.

SimCD simultaneously clusters cells and identifies differential gene expression in scRNA-seq data.

problem Separate clustering and differential expression analysis for scRNA-seq data leads to suboptimal results.
method Develops SimCD, a unified hierarchical gamma-negative binomial model for simultaneous cell clustering and differential expression analysis.
result SimCD outperforms existing methods in discovering cell clusters and capturing dynamic expression changes.

sgdGMF efficiently estimates generalized matrix factorization models for single-cell RNA sequencing data.

problem Challenges in dimensionality reduction for large single-cell RNA sequencing datasets.
method Scalable adaptive stochastic gradient descent algorithm for generalized matrix factorization models.
result sgdGMF outperforms existing methods in scalability and accuracy for large datasets.

TNDE quantifies dynamic gene drivers from single-cell snapshots.

problem Reconstructing time-resolved regulatory effects in biological processes.
method Time-varying Network Driver Estimation (TNDE) using shared graph attention encoder and partial optimal transport.
result TNDE identifies stage-specific driver genes in mouse erythropoiesis.

Paper proposes dp-VAE for preserving spatial context in gene expression data.

problem Inaccessibility of spatial context in single-cell gene expression data.
method Generic representation learning and transfer learning framework with a distance-preserving regularizer.
result dp-VAE effectively reconstructs and imputes spatial context from gene expression data.

A new method uncovers discrete and continuous factors in gene expression data.

problem Jointly identifying discrete and continuous factors of variability without supervision.
method cpl-mixVAE framework using multiple interacting networks.
result The method successfully uncovers discrete and continuous factors in gene expression data.

New model identifies cell-specific genes for cancer prognosis.

problem No statistical model to integrate multiscale cancer data.
method Bayesian generalized promotion time cure models (GPTCMs).
result Improves cancer prognosis by identifying cell-specific genes.

SMAI framework tests and integrates single-cell data alignability.

problem Lack of a rigorous statistical test for alignability and distortion during alignment.
method Spectral manifold alignment and inference (SMAI) framework.
result SMAI outperforms existing methods in alignability testing and integration.

New model clusters cells and individuals, revealing genetic influences on cell types.

problem Clustering nested data with group-level and observation-level variables.
method Nested Atoms Model (NAM), Bayesian nonparametric approach.
result Identifies clusters of genetically similar individuals with homogeneous cell-type profiles.

Boolean matrix factorisation aims to decompose a binary data matrix into an approximate Boolean product of two low rank, binary matrices: one containing meaningful patterns, the other quantifying how the observations can be expressed as a combination of these patterns. We introduce the OrMachine, a probabilistic genera…

2017-02-20abs ↗pdf ↗

New metric scores perturbations across populations, not cells, improving model comparison.

problem Single-cell perturbation data overlaps, making per-cell accuracy unreliable.
method Average per-cell probability vectors over all cells of a perturbation to form a population profile and rank candidate perturbations.
result Classifier Discrimination Score (CDS) identifies true perturbation more reliably than pseudobulk-based scores.

EB-PCA reduces noise in high-dimensional PCA by estimating a joint prior distribution.

problem High-dimensional PCA noise in samples comparable to or larger than data.
method Empirical Bayes PCA using Kiefer-Wolfowitz MLE, random matrix theory, and AMP algorithm.
result EB-PCA achieves Bayes-optimal accuracy in spiked models and significantly improves over PCA in simulations and real data.

The paper tackles extrapolation of gene knockouts effects on RNA counts.

problem Modeling effects of gene knockouts on RNA counts for new perturbations.
method Formulated as a latent variable model with additive perturbation effects, proved identifiability, proposed PDAE for estimation.
result PDAE can accurately predict effects of unseen but identifiable perturbations.

Causal methods for GRN inference from single-cell data often fail in real-world benchmarks.

problem Understanding when and why causal methods for GRN inference from single-cell data fail in real-world benchmarks.
method Introduced a controlled diagnostic framework to isolate and measure seven pathologies.
result Causal methods dominate in clean and structurally favorable regimes but fail in specific pathologies.

New method improves Bayesian inference for parametric models, robust to misspecification.

problem Inference can be untrustworthy when parametric models are wrong.
method Adaptive nonparametric corrections for parametric Bayesian models using generalized Bayes.
result The method achieves robustness and efficiency, converging fast when the parametric model is close to true.

Scalable GPLVM reduces complexity in scRNA-seq data, accounting for technical and biological confounders.

problem Complexity and confounders in scRNA-seq data hamper interpretation.
method Extended Gaussian process latent variable model (GPLVM) to handle large datasets.
result Framework reconstructs latent signatures and captures disease-specific gene expression.

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.

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.

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 ↗

Deep learning detects bifurcations in dynamical systems.

problem Predicting catastrophic changes in dynamical systems across sciences.
method Data-driven, physically-informed deep-learning framework for classifying dynamical regimes and characterizing bifurcation boundaries.
result Extracts topologically invariant features to detect bifurcation boundaries in unseen systems.

Graph auto-encoder predicts unobserved node features from biological networks and omics data.

problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.