PreprintCited by 1Protein Structure and DynamicsMachine Learning in BioinformaticsRNA and protein synthesis mechanisms

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Controllable Protein Design via Autoregressive Direct Coupling Analysis Conditioned on Principal Components

Open access
Caredda, Francesco, Gennai, Lisa, De Los Rios, Paolo, Pagnani, Andrea·2025·PLoS Computational Biology

Preprint — published as 10.1371/journal.pcbi.1013996

Abstract

We present FeatureDCA, a statistical framework for protein sequence modeling and generation that extends Direct Coupling Analysis (DCA) with biologically meaningful conditioning. The method can leverage different kinds of information, such as phylogeny, optimal growth temperature, enzymatic activity or, as in the case presented here, principal components derived from multiple sequence alignments, and use it to improve the learning process and consequently efficiently condition the generative process. FeatureDCA allows sampling to be guided toward specific regions of sequence space while maintaining the efficiency and interpretability of Potts-based inference. Across multiple protein families, our autoregressive implementation of FeatureDCA matches or surpasses the generative accuracy of established models in reproducing higher-order sequence statistics while preserving substantial sequence diversity. Structural validation with AlphaFold and ESMFold confirms that generated sequences adopt folds consistent with their intended wild-type targets. In a detailed case study of the Response Regulator family (PF00072), which comprises distinct structural subclasses linked to different DNA-binding domains, FeatureDCA accurately reproduces class-specific architectures when conditioned on subtype-specific principal components, highlighting its potential for fine-grained structural control. Predictions of experimental deep mutational scanning data show accuracy comparable to that of unconditioned autoregressive Potts models, indicating that FeatureDCA also captures local functional constraints. These results position FeatureDCA as a flexible and transparent approach for targeted sequence generation, bridging statistical fidelity, structural realism, and interpretability in protein design.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1101/2025.08.18.669886

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 34

  1. 1985, A learning algorithm for boltzmann machines, Cognitive Science, 9, 147
  2. 10.1093/molbev/msy007 · DOI
  3. 10.1186/s12859-021-04441-9 · DOI
  4. 2021, Sparse generative modeling via parameter reduction of Boltzmann machines: Application to protein-sequence families, Physical Review E, 104, 024407, 10.1103/PhysRevE.104.024407 · DOI
  5. 2021, Efficient generative modeling of protein sequences using simple autoregressive models, Nature Communications, 12, 5800, 10.1038/s41467-021-25756-4 · DOI
  6. 10.1126/science.aba3304 · DOI · Paper page
  7. 2018, Deep generative models of genetic variation capture the effects of mutations, Nature Methods, 15, 816, 10.1038/s41592-018-0138-4 · DOI · Paper page
  8. 2024, Protein Ensemble Generation Through Variational Autoencoder Latent Space Sampling, Journal of Chemical Theory and Computation, 20, 2689, 10.1021/acs.jctc.3c01057 · DOI
  9. 2021, Expanding functional protein sequence spaces using generative adversarial networks, Nature Machine Intelligence, 3, 324, 10.1038/s42256-021-00310-5 · DOI · Paper page
  10. Ali Madani , Bryan McCann , Nikhil Naik , Nitish Shirish Keskar , Namrata Anand , Raphael R. Eguchi , Po-Ssu Huang , and Richard Socher . ProGen: Language Modeling for Protein Generation, March 2020. · DOI
  11. 10.1073/pnas.2016239118 · DOI · Paper page
  12. Ananthan Nambiar , Simon Liu , Mark Hopkins , Maeve Heflin , Sergei Maslov , and Anna Ritz . Transforming the Language of Life: Transformer Neural Networks for Protein Prediction Tasks, June 2020. · DOI
  13. 2021, The language of proteins: NLP, machine learning & protein sequences, Computational and Structural Biotechnology Journal, 19, 1750, 10.1016/j.csbj.2021.03.022 · DOI
  14. Roshan M. Rao , Jason Liu , Robert Verkuil , Joshua Meier , John Canny , Pieter Abbeel , Tom Sercu , and Alexander Rives . MSA Transformer. In Proceedings of the 38th International Conference on Machine Learning, pages 8844–8856. PMLR, July 2021.
  15. Nicholas Bhattacharya , Neil Thomas , Roshan Rao , Justas Dauparas , Peter K. Koo , David Baker , Yun S. Song , and Sergey Ovchinnikov . Single Layers of Attention Suffice to Predict Protein Contacts, December 2020. · DOI
  16. 2025, Direct coupling analysis and the attention mechanism, BMC Bioinformatics, 26, 41, 10.1186/s12859-025-06062-y · DOI
  17. Sarah Alamdari , Nitya Thakkar , Rianne van den Berg , Neil Tenenholtz , Robert Strome , Alan M. Moses , Alex X. Lu , Nicolò Fusi , Ava P. Amini , and Kevin K. Yang . Protein generation with evolutionary diffusion: Sequence is all you need, November 2024. · DOI · Paper page
  18. 10.1126/science.ade2574 · DOI · Paper page
  19. 10.1126/science.ads0018 · DOI · Paper page
  20. 10.1038/S41586-024-07487-W · DOI · Paper page
  21. 10.1073/pnas.1111471108 · DOI · Paper page
  22. 10.1088/1361-6633/aa9965 · DOI
  23. 10.1093/nar/28.1.235 · DOI · Paper page
  24. 10.1016/j.jmb.2016.08.003 · DOI · Paper page
  25. 10.1146/annurev.micro.091208.073214 · DOI
  26. 10.1016/j.jmb.2013.02.003 · DOI
  27. 10.1002/wcms.1298 · DOI
  28. 10.1093/NAR/GKAA913 · DOI · Paper page
  29. 10.1093/NAR/GKAC993 · DOI
  30. 10.1093/molbev/msv211 · DOI
  31. 10.1073/pnas.1215206110 · DOI
  32. 10.1016/j.jmb.2019.04.030 · DOI
  33. 10.1007/BF01589116 · DOI
  34. 2011, Accelerated Profile HMM Searches, PLOS Computational Biology, 7, e1002195, 10.1371/journal.pcbi.1002195 · DOI · Paper page

Metadata

Authors
Caredda, F., Gennai, L., De Los Rios, P., & Pagnani, A.
Affiliations
  • Politecnico di Torino (IT)
  • École Polytechnique Fédérale de Lausanne (CH)
Corresponding author
Caredda, Francesco
Venue
PLoS Computational Biology
Publisher
openRxiv
Published
2025-08-22
Volume
22
Issue
2
Pages
e1013996-e1013996
ISSN
1553-734X (ISSN-L)
OpenAlex
W7130591261
Cited by
1
References
2
Citations by year
2026: 1
FWCI
2.07
Type
journal article
Language
en
Open access
Locations
  • PLoS Computational Biology (publishedVersion, cc-by)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by)
  • PubMed (publishedVersion)
  • PubMed Central (publishedVersion, cc-by)
  • PORTO@Iris (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
Funders
  • NextGenerationEU
  • MIUR Progetti di Ricerca di Rilevante Interesse Nazionale
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA and protein synthesis mechanisms
Keywords
protein design, direct coupling analysis, principal components, Potts model, protein sequence modeling, DNA-binding domain, deep mutational scanning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review