CoChat

A high-level programming language for generative protein design

Open access
Hie, Brian, Candido, Salvatore, Lin, Zeming, Kabeli, Ori, Rao, Roshan, Smetanin, Nikita, Sercu, Tom, Rives, Alexander · 2022 · bioRxiv (Cold Spring Harbor Laboratory)
PreprintCited by 57

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

Abstract

Combining a basic set of building blocks into more complex forms is a universal design principle. Most protein designs have proceeded from a manual bottom-up approach using parts created by nature, but top-down design of proteins is fundamentally hard due to biological complexity. We demonstrate how the modularity and programmability long sought for protein design can be realized through generative artificial intelligence. Advanced protein language models demonstrate emergent learning of atomic resolution structure and protein design principles. We leverage these developments to enable the programmable design of de novo protein sequences and structures of high complexity. First, we describe a high-level programming language based on modular building blocks that allows a designer to easily compose a set of desired properties. We then develop an energy-based generative model, built on atomic resolution structure prediction with a language model, that realizes all-atom structure designs that have the programmed properties. Designing a diverse set of specifications, including constraints on atomic coordinates, secondary structure, symmetry, and multimerization, demonstrates the generality and controllability of the approach. Enumerating constraints at increasing levels of hierarchical complexity shows that the approach can access a combinatorially large design space.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1101/2022.12.21.521526

Cites

20 of 20 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Show all 20 references

Research works printed but not linked: 23

  1. 1968, Are there pathways for protein folding?, Extrait du Journal de Chimie Physique, 65, 44
  2. 10.1073/pnas.78.7.4304 · DOI
  3. 10.1038/416657a · DOI
  4. 10.1073/pnas.81.4.1075 · DOI · Paper page
  5. 10.1038/380730a0 · DOI · Paper page
  6. 10.1126/science.282.5393.1462 · DOI · Paper page
  7. 10.1126/science.1089427 · DOI · Paper page
  8. 10.1110/ps.04774004 · DOI
  9. 10.1038/nbt0398-258 · DOI · Paper page
  10. 10.1038/nsb805 · DOI · Paper page
  11. 10.1093/protein/gzi048 · DOI · Paper page
  12. Chloe Hsu , Robert Verkuil , Jason Liu , Zeming Lin , Brian Hie , Tom Sercu , Adam Lerer , and Alexander Rives . Learning inverse folding from millions of predicted structures. In Proceedings of the 39th International Conference on Machine Learning, pages 8946–8970, 2022. · DOI · Paper page
  13. 10.1111/bph.12106 · DOI · Paper page
  14. 10.1101/2021.07.18.452833 · DOI · Paper page
  15. 10.1016/0022-2836(73)90011-9 · DOI · Paper page
  16. 10.1186/s12859-018-2367-z · DOI · Paper page
  17. 10.1093/bioinformatics/13.3.291 · DOI
  18. 10.1107/S0567739476001873 · DOI · Paper page
  19. 10.1016/j.str.2005.01.016 · DOI
  20. 10.1126/science.1059118 · DOI · Paper page
  21. 10.1016/j.cell.2016.05.073 · DOI · Paper page
  22. 10.1016/j.celrep.2022.110812 · DOI · Paper page
  23. 10.1093/nar/28.1.235 · DOI · Paper page

Cited by

See all 57

Metadata

Authors
Hie, B., Candido, S., Lin, Z., Kabeli, O., Rao, R., Smetanin, N., Sercu, T., & Rives, A.
Venue
bioRxiv (Cold Spring Harbor Laboratory)
Publisher
openRxiv
Published
2022-12-22
OpenAlex
W4312198087
Cited by
57
References
20
Type
posted content
Language
en
Open access
green

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A high-level programming language for generative protein design. https://app.cochat.ai/papers/10.1101/2022.12.21.521526
The paper
Hie, B., Candido, S., Lin, Z., Kabeli, O., Rao, R., Smetanin, N., Sercu, T., & Rives, A. (2022). A high-level programming language for generative protein design. bioRxiv (Cold Spring Harbor Laboratory). https://doi.org/10.1101/2022.12.21.521526

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.