Papers for

bioinformatics software engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Drug target affinity models change with chemical and biological shifts

Beyond Random Splits: Evaluating Drug-Target Affinity Models Under Chemically and Biologically Motivated Distribution Shifts Copy

Abstract: Drug-target affinity (DTA) prediction is widely used to prioritize candidate compounds before costly experimental screening. DTA models are often compared under a single data split, even though deployment may require extrapolation to new chemical series, new protein targets, or both. We ask whether the distribution shift used for evaluation changes which architecture appears best. We curate 718,800 unique drug-protein pairs from the ChEMBL and BindingDB datasets. We compare a Morgan-fingerprint + protein-CNN baseline with 12 controlled architectures that combine four drug representations with three ESM-2 interaction modes. Mean validation RMSE increases from 0.950 and 0.945 under scaffold and fingerprint-cluster OOD to 1.299 and 1.321 under protein-cluster and dual OOD. Model rankings are similar across the two chemical shifts (tau = 0.79), but agreement with scaffold OOD falls under protein OOD (tau = 0.39) and reverses under dual OOD (tau = -0.55). Held-out evaluation, repeated seeds, group-aware bootstrap analysis, and a size-matched control support the same conclusion: architecture selection depends on the form of extrapolation, not only on average error or training-set size. DTA benchmarks should therefore match the chemical and target shifts expected at deployment.

Fri 2 OctMachine Learning
The gist
Predicting how well drugs will bind to proteins helps scientists find promising medicines faster. The authors show that the way these predictions are tested can change which computer methods look best. They found that models perform differently when tested on new kinds of drugs or new protein targets, and the best method depends on these testing conditions. This means evaluation should match real-world use to pick the right model.
Open → 2610.03456v1

Planar graph shortest path algorithm gets simpler clear analysis

Simple analysis of an algorithm for multiple-source shortest paths in planar graphs

Abstract: This paper addresses the following problem: given a planar embedding graph, compute a representation of the shortest-path trees rooted at all the boundary nodes of the graph. Klein gave an $O(n \log n)$ algorithm for this problem; the algorithm subsequently became an essential ingredient in dozens of algorithms, addressing problems ranging from distance oracles to edit distance. However, the correctness and analysis in that original paper is complicated and messy and hard to understand. In this paper, we give a simple and clear analysis.

Thu 1 OctData Structures and Algorithms
The gist
This paper looks at the problem of finding shortest paths in flat, planar graphs from multiple starting points along the graph's edges. An earlier method by Klein solved this with a relatively efficient algorithm, but its explanation was complicated and hard to follow. The authors provide a new, simpler explanation and proof to help people understand how the algorithm works and why it is correct. This clearer analysis can make it easier to use and build on this algorithm in other applications.
Open → 2610.02371v1

Transformer model predicts cell responses to psilocybin drug effects

A Transformer-Based Delta Expression Encoder for Psilocybin Transcriptional Response: Architecture, Representations, and Biological Validation

Abstract: Understanding why individuals respond differently to psilocybin requires modeling the drug's transcriptional perturbation signature at the cell-type level. I present a Transformer-based delta expression encoder that learns to classify differential gene expression status - upregulated, downregulated, or neutral - from single-nucleus RNA-sequencing data, without supervision from pathway annotations or prior biological knowledge. The model is trained on pseudobulk profiles from 623 examples spanning 18 cell types, 2 drug conditions, and 6 timepoints derived from the Liao et al. 2025 dataset, and achieves 69.4% weighted classification accuracy. Three principal findings are reported, alongside one direct test of a published hypothesis that returned a result inconsistent with that hypothesis. First, per-cell-type classification accuracy ranges from 28.3% (L2/3 IT, a primary HTR2A-expressing psilocybin target) to 99.6% (endothelial cells), consistent with known psilocybin response biology. Second, psilocybin-induced transcriptional downregulation is significantly more stereotyped across individuals than upregulation (Mann-Whitney U=18615.0, p<0.0001), a novel finding with a cortical depth gradient across excitatory subtypes. Third, attention-guided gene co-regulation analysis recovers drug-specific modules without pathway supervision. Separately, a direct test of whether baseline HTR2A expression predicts drug-response separability across cell types found a significant negative correlation (Spearman r = -0.7088, p = 0.0021), the opposite of what a simple HTR2A-gating account would predict.

Tue 8 SeptMachine Learning
The gist
People react differently to the psychedelic drug psilocybin, and this depends on how it changes gene activity in brain cells. The authors trained a type of AI called a Transformer on detailed gene data from brain cells to predict if genes are turned on or off after taking psilocybin. Their model can guess these changes reasonably well without needing pre-existing knowledge about biological pathways. They found that gene activity patterns vary a lot by cell type and that some expected biological links did not hold true, offering new insights into how psilocybin affects the brain.
Open → 2609.08165v1