Your paper timeline
Scroll AI takes the way you would scroll a great paper aggregator: quick signal first, deeper critique when something earns your attention, and challenges when a claim feels off.
3 papers in q-bio.BM
Trending mixes fresh papers with community signal.
0
cs.LGq-bio.BM Zhou Zhang, Hanqun Cao, Minghao Sun et al. · Oct 22, 2026

RiboBridge addresses the challenge of designing RNA molecules that bind to target protein structures when neither the native RNA sequence/structure nor the binding interface is known. Its core idea is to separate RNA conformation generation in a pretrained discrete structural space (RiboSphere) from protein-relative assembly via predicted cross-frame interaction geometry and rigid placement. This decomposition matters because high-quality protein–RNA complex data are scarce and existing methods entangle conformational sampling with interface discovery.

Designing RNA molecules that bind to target protein structures requires generating both an RNA conformation and its bound complex geometry, without assuming a predefined binding site. Existing approaches generally model these coupled processes within a unified representation, entangling RNA conformation generation with protein-relative placement. In this work, we introduce RiboBridge, a structure-first framework that separates RNA conformational generation from protein--RNA assembly through cross-frame interaction geometry. RiboBridge first proposes multiple candidate RNA-binding interfaces on the protein surface, generates canonical RNA conformations within a pretrained RNA structural latent space (RiboSphere), and then predicts protein--RNA interaction constraints to bridge the independently defined RNA and protein coordinate frames. The resulting interaction geometry is converted into a geometrically consistent protein-relative pose through rigid placement. We evaluate RiboBridge on a temporally split, sequence-filtered, and redundancy-controlled benchmark of 124 protein--RNA complexes. Under post-hoc interface-correspondence evaluation, where native information is used only after generation to select among already generated predicted-pocket candidates, RiboBridge achieves the highest fNAT and DockQ and the lowest interface and ligand RMSDs among compared methods. Component ablations and stage-wise diagnostics further characterize the contributions of RNA conformational generation, interaction prediction, and rigid placement, identifying the main sources of complex-recovery error.
0
cs.LGq-bio.BM Tong Chen, Maximilian Holsman, Lin Zhao et al. · Oct 1, 2026

pCoMole addresses the problem of editing existing biomolecular sequences to improve multiple properties while obeying hard feasibility constraints such as PAM specificity or emission range. Its core idea is to steer a pre-trained Edit Flow via a Doob-$h$ transform, using an augmented Tchebycheff utility over terminal states that is approximated through short Monte Carlo rollouts. This matters because existing shrinkage methods like RayGun and SCISOR optimize length alone, whereas biomolecular engineering inherently requires trading off function, developability, and manufacturability. The work is notable for combining a clean theoretical justification with preliminary wet-lab validation on shortened eGFP variants.

Biomolecular therapeutics often start from known sequences and require targeted editing to improve multiple properties while satisfying hard biochemical and manufacturability constraints. However, existing generative methods do not jointly support multi-objective optimization, hard feasibility, and sequence editing in discrete, variable-length biological spaces. In this work, we introduce Pareto-Constrained Molecule Editing (pCoMole), a framework built on discrete flow matching that steers a pre-trained Edit Flow toward user-specified preferences while enforcing terminal feasibility. pCoMole defines a feasibility-gated terminal distribution using an augmented Tchebycheff utility and realizes the resulting preference tilt through a Doob-h transform of the underlying edit process. To make this construction practical, we approximate the required harmonic function using short Monte Carlo rollouts over candidate edits, yielding an efficient guided editor with provable preference consistency. We validate pCoMole by shrinking GFP while retaining fluorescence-related properties, shortening diverse Cas9 orthologs while preserving PAM specificity, and compressing peptide binders into short peptidomimetics that optimize seven drug-related properties under hard constraints. In wet lab testing, two 229-residue pCoMole-designed eGFP variants retained clear green fluorescence in BL21 cells after 10 deletions, with either one or two substitutions. Together, pCoMole enables constraint-aware, Pareto-aligned editing of biomolecular sequences in discrete, variable-length spaces.
0
cs.LGq-bio.BM Shan Yu, Xuening Wu · Oct 1, 2026

Detecting cryptic ligand-binding pockets from unbound protein structures is difficult because the pockets are often absent or closed in apo conformations. The authors propose an algebraic counting field (ACF) that maps explicit local structural features into compact, integer-weighted lookup tables so that every residue score can be mechanically reconstructed from training counts and spatial aggregation. The goal is to achieve competitive cryptic-pocket prediction while keeping the inference fully auditable, without relying on sequence homology, structural templates, or deep learning at inference time.

Cryptic ligand-binding pockets are not apparent in experimentally determined apo structures, making them difficult to identify from unbound receptor geometry. A complementary challenge is to make the structural measurements and learned evidence behind each prediction directly inspectable. We introduce a supervised algebraic counting field (ACF) for predicting cryptic-pocket residues from apo structures. ACF compiles explicit geometric, physicochemical, and topological features into compact, integer-weighted lookup tables. Each prediction score can be reconstructed from feature values, training counts, table weights, and spatial aggregation, without sequence search, structural-template transfer, or a protein language model at inference. We evaluate ACF on CryptoBench and two locked external collections, separating ranking performance from the effects of residue-calling budgets. On an external set of 57 post-CryptoBench apo-holo units, ACF exceeded P2Rank by +0.044 in mean paired ROC-AUC (multiplicity-adjusted 95% CI [+0.010, +0.079]). The advantage was dataset-dependent: official-fold ROC-AUC and matched-budget F1 differences against P2Rank remained unresolved, and a second external evaluation did not confirm gains from added structural features. ACF thus provides a compact predictor with externally validated signal and an inspectable path from structural measurements and training counts to residue scores.