Search bioRxiv⌕ Search

Biology subjects

Ruan, P.

Publications and source records attributed to Ruan, P..

4 recordsLinked to original sources

GPSNorm: Gaussian Process Spatial Normalization for Spatial Transcriptomics

Spatial transcriptomics technologies enable measurement of gene expression while preserving spatial tissue organization, but they remain highly sensitive to technical variability such as library size differences, slide-level effects, and spatial artifacts. Most existing normalization approaches treat normalization as a preprocessing step and perform downstream analyses on normalized values as fixed inputs, ignoring the uncertainty introduced during normalization. We introduce GPSNorm (Gaussian Process Spatial Normalization), a Bayesian spatial normalization framework that jointly models technical variation, spatial structure, and biological signal within a unified hierarchical model. GPSNorm represents gene expression counts using a negative binomial latent Gaussian model whose spatial component is a Gaussian Markov random field approximating a Gaussian process and performs efficient approximate Bayesian inference using the Integrated Nested Laplace Approximation (INLA), producing posterior estimates that propagate normalization uncertainty into downstream differential expression analysis. In simulations anchored to empirical spatial transcriptomics data, GPSNorm accurately recovers spatial technical structure and improves log-fold change estimation compared with existing normalization methods. Applications to three spatial transcriptomics datasets--including human dorsolateral prefrontal cortex Visium data, a GeoMx COVID-19 lung damage study, and the Spatial Organ Atlas kidney dataset--demonstrate improved preservation of biologically expected spatial patterns and marker gene contrasts. These results show that jointly modeling normalization and downstream inference can improve the robustness and interpretability of spatial transcriptomics analyses.An open-source R implementation of GPSNorm is available at https://github.com/Tiny-Quant/GPSNorm.

bioinformatics↗

N-Power AI: A Specialized Agent Framework for Automated Sample Size and Power Analysis in Clinical Trial Design

BackgroundSample size and power analysis are essential in biomedical research and investigations, particularly in clinical trial design, as they ensure sufficient statistical power to detect meaningful effects. However, the complexity of these calculations often requires specialized statistical expertise, making the process inconvenient and limiting accessibility for researchers during early-stage study planning. MethodsWe developed N-Power AI, an agentic framework leveraging large language models (LLMs) to perform sample size and power calculations across diverse study designs. The framework consists of three specialized agents: the Function Agent, a perception and reasoning module that identifies appropriate statistical tests and corresponding R functions; the Calculation Agent, an action module that extracts parameters and executes precise computations; and the Reporting Agent, a presentation module that generates comprehensive, downloadable reports. N-Power AI and advanced LLMs (e.g., GPT-o1, Claude 3.5, Gemini 1.5 Pro) were evaluated against ground truths from statistical software (R) across six common clinical trial scenarios. ResultsDirect LLM outputs showed significant deviations from ground-truth values, particularly in complex scenarios like the Chi-Square Test and Cox Proportional Hazards Model. In contrast, N-Power AI achieved 100% agreement with ground truths across all scenarios. This accuracy is attributed to the Function Agents correct selection of statistical methods, the Calculation Agents accurate computations, and the Reporting Agents ability to produce clear and comprehensive summaries. ConclusionN-Power AI automates sample size and power analysis, offering an effective, efficient, and accessible solution for early-stage study planning. While human expertise remains crucial for high-level statistical planning, N-Power AI enhances accessibility and efficiency, streamlining the analysis process to generate reliable and reproducible results for a wide range of research scenarios.

bioinformatics↗

TAL1-mediated epigenetic modifications down-regulate the expression of GIMAP family in non-small cell lung cancer

BackgroudThe study was designed to explore the role of GIMAP family in non-small cell lung cancer (NSCLC) and its possible expression regulation mechanisms using existing biological databases including encyclopedia of DNA elements (ENCODE), gene expression omnibus (GEO), and the cancer genome atlas (TCGA).\n\nMethodsLung squamous cell carcinoma (LUSC) and lung adenocarcinoma (LUAD) were used to evaluate the expression of GIMAPs in TCGA. Five NSCLC datasets were then selected from GEO for validation. RNA-seq and Chip-seq data from ENCODE and GEO were used to observe epigenetic modifications on the chromosomes of GIAMPs in NSCLC. We constructed protein-protein interaction (PPI) network to reveal the main interacting proteins of GIMAPs. We then analyzed the correlation and regulatory mechanism between TAL1 and the expression of GIMAP family. We also used Kaplan-Meier for survival analysis.\n\nResultsAll 7 genes in the GIMAP family were down-regulated in NSCLC. H3K4me3 and H3K27ac disappeared, while H3K27me3 increased on the chromosome of this family. The expression of TAL1 was positively correlated with the expression of GIMAPs. sh-TAL1 significantly down-regulated the expression of GIMAP family through epigenetic modification. High expression of GIMAPs and TAL1 was found to be associated with a good prognosis of NLCSC.\n\nConclusionThe downregulation of TAL1 caused the disappearance of H3K27ac and H3K4me3. It also caused an increase in H3K27me3 on the GIMAPs gene, eventually leading to the overall downregulation of the GIMAP family genes.

bioinformatics↗

On the Number of Driver Nodes for Controlling a Boolean Network to Attractors

It is known that many driver nodes are required to control complex biological networks. Previous studies imply that O(N) driver nodes are required in both linear complex network and Boolean network models with N nodes if an arbitrary state is specified as the target. In this paper, we mathematically prove under a reasonable assumption that the expected number of driver nodes is only O(log2 N + log2 M) for controlling Boolean networks if the targets are restricted to attractors, where M is the number of attractors. Since it is expected that M is not very large in many practical networks, this is a significant improvement. This result is based on discovery of novel relationships between control problems on Boolean networks and the coupon collectors problem, a well-known concept in combinatorics. We also provide lower bounds of the number of driver nodes as well as simulation results using artificial and realistic network data, which support our theoretical findings.

systems biology↗