SearcharxivSearch

arXiv subjects

Roberto Netti

Publications and source records attributed to Roberto Netti.

3 recordsLinked to original sources

Reconstructability of evolutionary intermediates in generative epistatic landscapes

Evolutionary intermediates connect observed proteins, but the sequence of steps that produced them is rarely recoverable from extant data alone. Here we ask what can, and cannot, be inferred about such intermediates from the endpoints. Using generative sequence landscapes as controlled models of protein-family evolution, we benchmark data-driven reconstruction against ground-truth simulated trajectories. We find that the best point prediction is not necessarily the most faithful evolutionary reconstruction: maximum-likelihood intermediates can be residue-wise accurate yet statistically atypical, whereas conditional sampling better captures the ensemble of plausible histories. Predictability is limited by the topology of the landscape. Constrained, low-mutability regions preserve information about the path, while permissive high-mutability regions open many alternative routes and erase path-specific memory. We also show that sequence divergence alone is an insufficient measure of elapsed evolutionary time; incorporating endpoint mutability provides a more reliable way to place intermediates in the landscape. These results recast intermediate reconstruction as a calibrated probabilistic problem. Rather than seeking a single "true" sequence, data-driven models should identify when endpoints contain evolutionary information, and return realistic ensembles.

q-bio.PE

Expanding functional protein sequence space using high entropy generative models

Boltzmann Machines trained on evolutionary sequence data have emerged as a powerful paradigm for the data-driven design of artificial proteins. However, the relationship between model architecture, specifically parameter density, and experimental performance remains poorly understood. Here, we investigate this relationship using the Chorismate Mutase enzyme family as a model system. We compare standard fully connected Boltzmann Machines for Direct Coupling Analysis (bmDCA) with sparse models generated via progressive edge activation (eaDCA) and edge decimation (edDCA). We identify a maximum-entropy model (meDCA) along the decimation trajectory that represents an optimal balance between constraint satisfaction and the flexibility of the probability distribution. We synthesized and tested artificial sequences from all models using an in vivo complementation assay, finding that all architectures, regardless of sparsity, generate functional enzymes with high success rates, even at significant divergence from natural sequences. Despite this functional equivalence, we demonstrate that the meDCA model samples a viable sequence space that is more than fifteen orders of magnitude larger than its low-entropy counterparts. Furthermore, comparative analyses reveal that high-entropy models systematically minimize overfitting and better capture the local neutral spaces surrounding natural proteins. These findings suggest that while various models satisfying coevolutionary statistics can generate functional sequences, high-entropy Boltzmann Machines provide a superior representation of the underlying evolutionary fitness landscape.

q-bio.QM

adabmDCA 2.0 -- a flexible but easy-to-use package for Direct Coupling Analysis

In this methods article, we provide a flexible but easy-to-use implementation of Direct Coupling Analysis (DCA) based on Boltzmann machine learning, together with a tutorial on how to use it. The package \texttt{adabmDCA 2.0} is available in different programming languages (C++, Julia, Python) usable on different architectures (single-core and multi-core CPU, GPU) using a common front-end interface. In addition to several learning protocols for dense and sparse generative DCA models, it allows to directly address common downstream tasks like residue-residue contact prediction, mutational-effect prediction, scoring of sequence libraries and generation of artificial sequences for sequence design. It is readily applicable to protein and RNA sequence data.

q-bio.QM