Searcharxiv⌕ Search

arXiv subjects

Haihui Zhang

Publications and source records attributed to Haihui Zhang.

2 recordsLinked to original sources

Predicting transcriptional interactions with GrnPFN

Combinatorial therapies offer opportunities to improve treatment efficacy and overcome therapeutic resistance, but their rational design requires understanding how combined interventions interact beyond their individual effects. Combined genetic and chemical perturbations can elicit nonadditive transcriptional responses, yet the vast number of possible combinations limits experimental characterization. Predicting these interactions is particularly challenging when few or no combinations have been measured. Here we present GrnPFN, a prior-data fitted network that predicts nonadditive transcriptional responses to combinations from single-perturbation profiles. Pretrained on simulated screens generated from random gene-regulatory networks, GrnPFN incorporates measured combinations through in-context learning without retraining. We evaluated GrnPFN in single-cell screens spanning CRISPR activation, RNA knockdown and drug combinations, using separate cells to construct model inputs, training targets and test targets. Without measured combinations in the target screen, GrnPFN outperformed gradient boosting trained on other screens. With limited combination measurements, it outperformed kernel ridge regression fitted to the same measured pairs. These advantages extended to an additional screen combining CRISPR interference with a drug. Our results demonstrate that pretraining on simulated regulatory networks enables prediction of nonadditive transcriptional interactions across perturbation modalities when experimental measurements are scarce.

q-bio.MN↗

Vertex Arboricity of Toroidal Graphs with a Forbidden Cycle

The vertex arboricity $a(G)$ of a graph $G$ is the minimum $k$ such that $V(G)$ can be partitioned into $k$ sets where each set induces a forest. For a planar graph $G$, it is known that $a(G)\leq 3$. In two recent papers, it was proved that planar graphs without $k$-cycles for some $k\in\{3, 4, 5, 6, 7\}$ have vertex arboricity at most 2. For a toroidal graph $G$, it is known that $a(G)\leq 4$. Let us consider the following question: do toroidal graphs without $k$-cycles have vertex arboricity at most 2? It was known that the question is true for k=3, and recently, Zhang proved the question is true for $k=5$. Since a complete graph on 5 vertices is a toroidal graph without any $k$-cycles for $k\geq 6$ and has vertex arboricity at least three, the only unknown case was k=4. We solve this case in the affirmative; namely, we show that toroidal graphs without 4-cycles have vertex arboricity at most 2.

math.CO↗