Quantitative Methods
Beyond Tokens: Probing Higher-Order Epistasis in Learned Protein Representations
Maryam Rahimimovassagh, Ivan Garibay and Niloofar Yousefi
Protein fitness landscapes contain nonlinear interactions in which mutation effects depend on other residues. We introduce ORBIT, an Order-Resolved Benchmarking of Interaction Transformations framework that separates interaction presence, representation accessibility, and functional recovery. ORBIT first validates Walsh-based diagnostics on synthetic landscapes with known interaction order, then analyzes the experimentally measured GB1 fitness landscape under the FLIP 2-vs-rest setting. We compare ridge regression, a standard MLP, independent
tokens, nonlinear independent
tokens, and Residual Interaction Tokenization (RIT). Across 20 paired training seeds, the primary two-hidden-layer comparison found no significant architecture differences in FLIP test R^2, third- or fourth-order functional recovery, or final-layer third- or fourth-order accessibility. However, RIT significantly increased pairwise accessibility at the
token stage relative to both independent-
token controls (Delta A_tok,2 = 0.2468, d_z = 1.67, Holm-adjusted p = 1.14 x 10^-5), without a detectable downstream higher-order advantage. A pre-specified depth/capacity analysis showed that deeper MLPs improved FLIP prediction, third-order functional recovery, and final-layer third-order accessibility; fourth-order accessibility also improved relative to the shallow MLP but remained below zero in absolute held-out R^2. ORBIT therefore reveals representation-level changes hidden by conventional prediction metrics and distinguishes early interaction-aware encoding from higher-order structure constructed by downstream nonlinear capacity.
Read the full abstract ▾
Quantitative Methods
Finch: Toxicity Dose Response Curve Prediction of Chemical Compounds and Mixtures
Abdullah Shouaib, John Zapanta, Sean P. Davern et al. (+5 more)
A holistic approach to chemical mixtures is reshaping risk assessment emphasizing mixture testing over single compounds eliminating animal testing and advancing modeling methods. Most computational models still focus on individual chemicals and conventional mixture models like concentration addition and independent action are limited they struggle with multiple Modes of Action and often miss synergistic or antagonistic effects. Regulatory agencies need faster more efficient models that go beyond these constraints. Finch addresses these challenges with a novel workflow. It integrates molecular descriptor based frameworks and deep learning
embeddings in multi task quantitative structure activity relationship models for improved chemical exposure prediction. DL
embeddings preserve information from diverse inputs molecular descriptors physicochemical properties and large
language model
embeddings from SMILES by distilling key features into a latent space enhancing machine learning predictions. Finch multi task learning optimizes multiple loss functions simultaneously leveraging all available data to learn generalized representations. This enables effective modeling of complex ingredient interactions within mixtures offering a significant advancement for regulatory safety assessment.
Read the full abstract ▾
All authors Abdullah Shouaib, John Zapanta, Sean P. Davern, Samuel Dixon, Zachary R. Stromberg, Becky Hess, Sydney Schwartz, C Mark Maupin
Neurons and Cognition · Cross-listed from cs.CV
Primate vision reveals a missing principle for robust dynamic AI
Matteo Dunnhofer, Christian Micheloni and Kohitij Kar
How does an intelligent visual system combine what objects look like with how they move while remaining robust as appearance changes? We addressed this question by comparing human perception and neural activity in macaque inferior temporal cortex with representations from image- and
video-based neural networks spanning recognition, segmentation, optic-flow processing and predictive world modeling. Temporal integration improved object representations, but most
video recognition models generalized poorly when appearance was disrupted while motion structure was preserved. Humans and macaque IT remained robust. Notably, predictive world models combined strong cross-appearance generalization with the closest correspondence to IT, outperforming other
video-modeling approaches in neural fidelity. Yet no model reproduced the cortical transformation from early appearance-dominated responses toward later appearance-invariant motion coding. These results identify progressive integration of motion into object representations as a principle of robust dynamic
vision and implicate predictive learning as a promising route toward realizing this computation in artificial systems.
Read the full abstract ▾
Genomics
Optimizing RNA yield using deep neural networks coupled to massively parallel screening
Dinghai Zheng, Justin Hong, Jun Wang et al. (+4 more)
Messenger RNA (mRNA)-based therapeutics have emerged as a powerful platform for vaccines,
protein replacement therapies, and cancer immunotherapy. A critical bottleneck in mRNA development is manufacturing large quantities of RNA economically, as measured by RNA yield emerging from an in vitro transcription (IVT) reaction. However, how promoter-adjacent DNA sequences influence RNA yield remains poorly characterized. Here, we present an integrated deep learning framework that leverages massively parallel next-generation sequencing (NGS) assays to measure RNA yield across large sequence spaces. A library of 10^5 randomized oligonucleotide sequences was designed to systematically explore sequence diversity within a defined structural context. DNA and RNA abundances were quantified in parallel using Illumina sequencing, enabling high-resolution measurement of sequence-to-yield relationships at scale. Sequences were one-hot encoded and used to train deep learning models, using a convolutional neural network architecture. The model achieved a Pearson correlation of 0.94 between predicted and experimentally measured RNA yield on a held-out test set, demonstrating strong generalization across diverse sequence contexts. Importantly, the trained model can be deployed in a production environment to score and rank novel RNA sequence designs by predicted IVT yield, enabling cost-effective, pre-experimental prioritization of the most manufacturable candidates. This framework establishes a scalable, data-driven approach to DNA and RNA sequence optimization, with broad applicability to vaccine antigen design, therapeutic
protein delivery, and synthetic biology. By integrating high-throughput experimentation with advanced deep learning modeling, it significantly reduces screening costs and accelerates RNA engineering cycle times.
Read the full abstract ▾
All authors Dinghai Zheng, Justin Hong, Jun Wang, Adrien Villain, Mickaël Costallat, Fernando Ulloa Montoya, Vikram Agarwal
Populations and Evolution
The Informational Model of the Holobiont: Statistical Tests for Selection and Extension to a Theory of Variable Interactions
Antonio Carvajal-Rodríguez
We review, clarify, and generalize a recently proposed evolutionary information-theoretic model of the holobiont, in which evolutionary change is quantified using Jeffreys divergence and partitioned into contributions from the host, microbial components, and host-microbiome associations. Building on these partitions, we develop statistical tests to identify whether observed informational change is attributable to selection acting on host types, microbial-component states, or particular host-microbiome combinations. We then extend the framework to multicomponent groups subject to within- and between-group selection and, ultimately, to a general hierarchical formulation that we call the Theory of Variable Interactions (TVI). In this formulation, biological units may contain interacting components and may themselves form higher-level sets, allowing informational change to be partitioned recursively into marginal and association components across an arbitrary number of organizational levels. The framework encompasses previously studied models of the tragedy of the commons and of aggregate and multicomponent holobiont selection, and, as a further specialization, informational models of non-random mating and sexual selection. TVI therefore provides a unified information-theoretic framework for quantifying evolutionary change in both biological entities and their interactions, with local statistical dimensionality preserved across hierarchical levels while higher levels introduce additional relational dimensions.
Read the full abstract ▾
Biomolecules
PHASE: encoding global protein ensembles with local Hamiltonians and all-atom backmapping
Daniele Angioletti, Marco Nobile, Matteo Carli et al. (+1 more)
Protein function is governed by conformational ensembles, which can be viewed as high-dimensional probability distributions over molecular conformations. Yet the statistical organization of these distributions is often represented only implicitly, either through collections of simulation trajectories or within high-capacity generative models. Here, we introduce PHASE (
Protein Hamiltonians for Sampling of Ensembles), a system-specific framework that converts atomistic conformational ensembles into an explicit and interpretable statistical model. Applied to ten conformational ensembles derived from approximately 37$\mu$s of atomistic simulations of the adenosine A2A receptor,
Hamiltonians containing only local residue couplings within 6$\mathring{A}$ reproduce residue-wise and pairwise microstate statistics, including correlations between residues that are not directly coupled in the model. Moreover, independently fitted inactive and active reference
Hamiltonians define an endpoint preference coordinate that organizes newly sampled ligand-, effector- and conformation-dependent ensembles along the A2A activation landscape without receiving these biochemical labels as model inputs. Finally, a cluster-conditioned all-atom reconstruction model preserves the prescribed residue microstate patterns of newly sampled configurations, closing the coarse-graining-sampling-backmapping cycle. The resulting discrete representation additionally admits direct QUBO encoding, enabling classical annealing and providing a route toward future
quantum-annealing implementations. PHASE therefore provides a
protein-general procedure for constructing compact, interpretable and atomistically realizable statistical models of
protein conformational ensembles.
Read the full abstract ▾
All authors Daniele Angioletti, Marco Nobile, Matteo Carli, Vittorio Limongelli
Biomolecules
Analysis of correlations of dwell-times of adjacent kinetic states in the activity of the cold and menthol receptor TRPM8
Ogloblya O.V., Moroz O.F. and Zholos A.V
Temperature-sensitive transient receptor potential (TRP) channels play a significant role in intercellular signalling in response to membrane depolarisation and caclium influx. TRPM8 ion channels have been investigated as the main cold receptors (neurosensors), but they can also be activated by voltage, $Ca^{2+}$ store depletion, and certain lipids and other ligands that induce cold sensation (such as menthol and icilin). Despite recent progress in studying these channels at the single-channel level, the mechanisms and time course of their activation remain underexplored. We propose an approach to single-ion channel analysis that elucidates the presence of correlations between dwell-times of adjacent open and closed states. One of the major benefits of this approach is that it can serve as an express test of channel activity properties owing to its simplicity and fast numerical realization. The idea of our analysis is to study the difference between the distribution function derived from the given trace (simulated or experimentally recorded) and the predicted distributions of simple models without correlation. In this way, we compared the distribution function of the difference between the durations of the adjacent open and closed states of the channel, as well as that of a similar sequence of open-closed-open-closed states.
Read the full abstract ▾
Other Quantitative Biology
Beyond chlorophyll: machine learning estimates of diagnostic phytoplankton pigments from multispectral ocean colour data
David Moffat, Angus Laurenson, Victor Martinez-Vicente et al. (+4 more)
Phytoplankton play a central role in marine ecosystems and the global carbon cycle, with different groups contributing differently to ocean biogeochemical processes. While standard techniques exist for monitoring phytoplankton concentration from ocean-colour data, their community composition remains difficult to observe at large scales. Chlorophyll-a, widely available from satellite ocean-colour observations, is commonly used as a measure of phytoplankton biomass but provides limited information on taxonomic composition. Accessory pigments, some of which are diagnostic of important phytoplankton groups, offer additional information on community structure, but their
retrieval from ocean-colour data is challenging because of limited spectral resolution and strong covariance with chlorophyll-a. In this study, we evaluate machine learning methods for estimating diagnostic pigment concentrations from multispectral satellite observations. Using a global
dataset of 33,640 High Performance
Liquid Chromatography (HPLC) measurements matched with ESA Ocean Colour
Climate Change Initiative (OC-CCI) reflectance data, we compare Random Forest and TabPFN models trained on multispectral reflectance with baseline models using chlorophyll-a alone. A temporally stratified validation scheme is employed to reduce the effects of autocorrelation. Results show that multispectral models consistently outperform approaches based solely on satellite-derived chlorophyll-a, demonstrating that ocean-colour reflectance contains additional information relevant to pigment discrimination. Improvements vary by pigment, with those strongly correlated with chlorophyll-a showing limited gains, while others exhibit substantial improvement. These findings highlight the potential of machine learning to extract ecologically relevant information from satellite data beyond conventional chlorophyll-based approaches.
Read the full abstract ▾
All authors David Moffat, Angus Laurenson, Victor Martinez-Vicente, Gemma Kulk, Xuerong Sun, Robert J. W. Brewin, Shubha Sathyendranath
Populations and Evolution
Episode Clustering in Phylogenetic Networks
Paweł Górecki, Agnieszka Mykowiecka and Jarosław Paszek
The classical duplication episode clustering (EC) model introduced by Guigó et al. in the 1990s provides a foundational approach for inferring genomic duplication events crucial to understanding genome
evolution. This model clusters single gene duplications from a collection of gene trees at locations in the species tree to minimize the total number of such locations, called duplication episodes. Here, we introduce NetEC, a novel extension of this problem to phylogenetic networks. To solve NetEC, we first develop a
polynomial-time dynamic programming (DP)
algorithm for testing whether a given set of network nodes can serve as episode locations. We then propose a main inference
algorithm that utilizes this DP component to optimize the episode count; while the feasibility test runs in
polynomial time, the full optimization has exponential worst-case complexity, and an optional heuristic mode is provided for larger instances. We also propose an extended episode analysis procedure that identifies additional genomic duplication candidates below reticulation nodes, complementing the main
algorithm by resolving potential upward clustering of duplications induced by reticulation. We evaluate our method on simulated data and on an empirical Pandanales
dataset comprising over 29,000 gene trees, demonstrating exact and accurate inference of genomic duplication events even in the presence of multiple reticulations.
Read the full abstract ▾
Populations and Evolution · Cross-listed from math.CO
On the maximum size of 2-weakly compatible split systems
Pei Wu and Stefan Grünewald
We consider a Turán-type problem arising in phylogenetics: determining the maximum size of a 2-weakly compatible split system. This compatibility condition arises in the reconstruction of phylogenetic networks from quartet weights. It was previously shown that a 2-weakly compatible split system has size at most \[ 3\binom{n}{4}+\binom{n}{2}. \] We prove that the maximum size is $O(n^{5/2})$.
Read the full abstract ▾
Neurons and Cognition
Dendritic structure enables powerful plasticity
Ben von Hünerbein, Federico Benitez, Kevin Max et al. (+10 more)
Over the past decades, it has become increasingly clear that the complex morphology of cortical
neurons is more than just a quirk of
evolution, and that dendritic compartments serve as computational elements in their own right, rather than just providing connections between nerve
cell bodies. While most computational studies discuss the enhanced representational capabilities of multi-compartment models as compared to point
neurons, we focus here on the implications of neuronal morphology for synaptic plasticity. We argue that the ability of single
neurons to simultaneously encode multiple pieces of information gives synapses local access to more than just the classical Hebbian pre- and postsynaptic terms, and with much greater specificity and reaction speed than permitted by other globally modulated factors. Based on a comparative review of recent dendritic learning models, we show how such neuronal compartmentalization can provide synapses with the means for calculating various forms of error signals, which in turn give rise to powerful real-time and fully local instantiations of deep learning through gradient descent. Implemented within cortical microcircuits capable of propagating and manipulating these errors, compartmentalized
neurons thus ultimately enable the learning of far more complex tasks than are achievable by globally modulated Hebbian plasticity alone.
Read the full abstract ▾
All authors Ben von Hünerbein, Federico Benitez, Kevin Max, Julian Göltz, Paul Haider, Simon Brandt, Arno Granier, Timo Gierlich, Jakob Jordan, Katharina A. Wilmes, Jean-Pascal Pfister, Walter Senn, Mihai A. Petrovici
Molecular Networks
Systematic pathway comparison on the powerset of rule-based biochemical systems
Anne-Susann Abel, Sissel Banke, Erika M. Herrera Machado et al. (+4 more)
Computational pathway design often focuses on evaluating selected pathways or optimizing fluxes in a fixed network, but gives less direct access to the combinatorial question of which other enzyme subsets of the network can support productive alternative pathways. A structured computational analysis of these networks can act as a valuable pre-step to the pathway design process. We present here a systematic approach for exploring biochemical pathway alternatives across enzyme subsets, using a computational methodology based on a rule-based modeling of the enzymes: for a biochemical system with enzyme set $S$, we evaluate all subsets $s \subseteq S$ by generating chemical reaction spaces, searching for integer-hyperflow pathways from prescribed inputs to target products, and organizing feasible subsets by set inclusion. This yields an inclusion-ordered landscape of pathway feasibility and carbon efficiency. We apply the approach to the non-oxidative pentose phosphate pathway, to non-oxidative glycolysis, and to glycolysis. Across these systems, feasible subsets occupy only a moderate fraction of all enzyme subsets, but the structure of this feasible region differs strongly between the systems. Larger enzyme sets do not consistently improve carbon efficiency when every enzyme in the tested subset is required to participate in the pathway. Instead, performance depends on specific enzyme combinations. The resulting subset landscapes are valuable means for identifying essential enzymes, candidate redundancies, and small high-performing enzyme subsets. By making the enzyme-subset landscape itself the object of analysis, the approach addresses the gap between detailed evaluation of individual candidate pathways and early-stage design decisions about which enzyme combinations are worth investigating at all.
Read the full abstract ▾
All authors Anne-Susann Abel, Sissel Banke, Erika M. Herrera Machado, Jakob Lykke Andersen, Peter Dittrich, Rolf Fagerberg, Daniel Merkle
Molecular Networks
Uncovering Cellular Resolution in scRNAseq via Unbiased Cell and Gene Network Analysis
Olga lanzetta, Luisa Cutillo, Bailey Andrew et al. (+1 more)
Conventional annotation of single-
cell RNA-sequencing (scRNA-seq) data relies heavily on manual, marker-based thresholding, an approach that can obscure subtle transcriptomic gradients and collapse functionally distinct
cell states into broad, heterogeneous populations. Here we apply the Gaussian multi-Graphical Model (GmGM) framework, which jointly infers
cell-
cell and gene-gene dependency structure from a single scRNA-seq data
matrix, to a 10x Genomics PBMC
dataset. Ten independent GMGM-Leiden clustering runs were integrated into a robust consensus partition using a soft cluster ensemble approach and benchmarked against reference
cell-type annotations. This strategy yielded stable cluster partitions that resolve biologically meaningful sub-populations not distinguished by the reference annotation. In parallel, for each cluster, gene co-expression modules were extracted from the fitted model via consensus Leiden clustering across resolutions, evaluated using standard network metrics, and validated functionally with the Network Enrichment Analysis Test (NEAT), which confirmed non-random enrichment signal. A module-scoring procedure linked network
topology to per-
cell, per-cluster expression signatures, and a novel extension of GmGM, recovering a shared
cell-
cell network together with population-specific gene networks in a single model run, was demonstrated in a case study on the CD4+ T-
cell population. These results indicate that GmGM provides a unified, reproducible framework for joint
cell clustering and gene-network inference, capable of revealing cellular structure beyond that captured by conventional pipelines.
Read the full abstract ▾
All authors Olga lanzetta, Luisa Cutillo, Bailey Andrew, Claudia Angelini
Genomics · Cross-listed from cs.LG
RIBOSPAN: A Long-Context RNA Foundation Model for Versatile RNA Modeling
Ziyuan Wang, Bohao Tang, Fei Zhang et al. (+2 more)
Full-length RNAs, particularly messenger RNAs, often exceed the context lengths used to pretrain existing RNA foundation models, limiting complete-transcript modeling at single-nucleotide resolution. We present RIBOSPAN, a 1.61-billion-parameter bidirectional RNA foundation model natively pretrained with context lengths up to 10,240 nt. RIBOSPAN combines dense bidirectional self-
attention, single-nucleotide tokenization, and
attention-isolated sequence packing to enable high-resolution modeling of complete long RNAs. Native 10K pretraining preserves strong reconstruction at 10,240
tokens and, in a controlled long-context
benchmark, maintains strong contextual responsiveness and context-specific representation separation while keeping perturbation-induced changes highly localized. Inference-time YaRN scaling recovers much of the contextual organization lost by direct short-context extrapolation, but induces substantially greater distal representation
diffusion. Frozen RNA-type evaluations show that RIBOSPAN learns state-of-the-art RNA representations, with a particularly clear advantage on long RNAs. Across downstream biological
benchmarks, RIBOSPAN emerges as the strongest encoder-only RNA foundation model, achieving state-of-the-art performance in both full-transcript biological property prediction and zero-shot mutation-fitness modeling. Building on the same backbone, we develop a multidimensionally conditioned discrete-
diffusion framework for full-length mRNA generation and redesign, including synonymous-codon
diffusion for
protein-preserving CDS optimization. Together, RIBOSPAN establishes a powerful long-context foundation for transferable RNA representation learning, biological prediction, and full-transcript mRNA design.
Read the full abstract ▾
All authors Ziyuan Wang, Bohao Tang, Fei Zhang, Shuo Han, Pengfei Liu
Neurons and Cognition
Temporal filling-in reduces attentional fluctuations in sustained visual attention
Yingyu Huang, Liying Zhan and Xiang Wu
Our capacity to maintain focus on task-relevant goals over time is constrained because attentional states wax and wane moment to moment. One theoretical account posits that temporal filling-in - filling temporal blank intervals between target stimuli - reduces attentional fluctuations to enhance sustained
attention. This proposal, however, lacks direct empirical validation given the difficulty of tracking attentional fluctuations via behavioral measurements. To resolve this gap, we combined a visual timing task that assessed the behavioral benefit of temporal filling-in with electroencephalographic recordings of visual steady-state evoked potentials (SSEPs), which tracked neural responses associated with periodic attentional fluctuations entrained to the rhythmic visual sequence. Behavioral improvements in sustained
attention via temporal filling-in were associated with reduced attentional fluctuations, as indexed by attenuated visual SSEP amplitudes. The findings highlight a fundamental neural mechanism whereby temporal filling-in reduces attentional fluctuations to stabilize sustained visual
attention over extended periods.
Read the full abstract ▾
Populations and Evolution · Cross-listed from physics.soc-ph
Evolution of cooperation with Q-learning: how much information do we need?
Yile Ku, Xin Ou, Jiqiang Zhang et al. (+3 more)
Cooperation is ubiquitous in both natural and human societies, yet its evolutionary basis remains a major challenge. A long-standing puzzle is whether having more information leads to better decision-making and thus a higher level of cooperation. To address this question, we adopt a recently developed reinforcement learning framework in which individuals learn through trial and error to maximize cumulative rewards - a paradigm that has successfully explained diverse emergent patterns in human behaviors. Specifically, we equip a structured population with the Q-learning
algorithm and systematically vary the size of the interactive neighborhood, which serves as a proxy for perceived information. Interestingly, we observe a non-monotonic relationship between cooperation prevalence and neighborhood size in both two-dimensional square
lattices and Barabasi-Albert scale-free networks. This inverted U-shaped dependence reveals that an optimal amount of information exists, yielding the highest level of cooperation. Mechanistic analyses show that a moderate neighborhood size enables individuals to strike an optimal balance between information sufficiency and decision-making tractability. This balance allows them to detect reciprocal opportunities while avoiding the deterioration of decision quality due to information overload. Our findings challenge everyday intuition, suggesting that a proper amount of information - not more - is optimal for the emergence of cooperation.
Read the full abstract ▾
All authors Yile Ku, Xin Ou, Jiqiang Zhang, Shengfeng Deng, Huiji Yue, Li Chen