Protein Design Using Continuous Rotamers
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
UNLABELLED: Optimizing amino acid conformation and identity is a central problem in computational protein design. Protein design algorithms must allow realistic protein flexibility to occur during this optimization, or they may fail to find the best sequence with the lowest energy. Most design algorithms implement side-chain flexibility by allowing the side chains to move between a small set of discrete, low-energy states, which we call rigid rotamers. In this work we show that allowing continuous side-chain flexibility (which we call continuous rotamers) greatly improves protein flexibility modeling. We present a large-scale study that compares the sequences and best energy conformations in 69 protein-core redesigns using a rigid-rotamer model versus a continuous-rotamer model. We show that in nearly all of our redesigns the sequence found by the continuous-rotamer model is different and has a lower energy than the one found by the rigid-rotamer model. Moreover, the sequences found by the continuous-rotamer model are more similar to the native sequences. We then show that the seemingly easy solution of sampling more rigid rotamers within the continuous region is not a practical alternative to a continuous-rotamer model: at computationally feasible resolutions, using more rigid rotamers was never better than a continuous-rotamer model and almost always resulted in higher energies. Finally, we present a new protein design algorithm based on the dead-end elimination (DEE) algorithm, which we call iMinDEE, that makes the use of continuous rotamers feasible in larger systems. iMinDEE guarantees finding the optimal answer while pruning the search space with close to the same efficiency of DEE. AVAILABILITY: Software is available under the Lesser GNU Public License v3. Contact the authors for source code.
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.
Integrity signals
Registry
Cites
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.
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
Amino acid substitution matrices from protein blocks.
Henikoff, S., & Henikoff, J. G. (1992) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.89.22.10915 · Cited by 6,218 · cited 2×
“Training was performed by redesigning each group of low-SASA residues with rigid DEE/A* and allowing each amino acid to be mutated to the same 5–7 amino acids allowed in the design runs, which were based on the BLOSUM62 matrix [36].”
MethodComputational design of antibody-affinity improvement beyond in vivo maturation
Lippow, S. M., Wittrup, K. D., & Tidor, B. (2007) · Nature Biotechnology · doi:10.1038/nbt1336 · Cited by 342 · cited 2×
“To overcome this rotamer explosion, some protein design protocols [14,15] add more rotamers by altering only the x 1 or x 1 and x 2 angles by + 1 standard deviation ( s ) .”
Method
Cited by
Principles and Overview of Sampling Methods for Modeling Macromolecular Structure and Dynamics
Maximova, T., Moffatt, R., Ma, B., Nussinov, R., & Shehu, A. (2016) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004619 · Cited by 216
“It is worth noting that unlike discrete rotamer assignments, work by Donald and colleagues pursues continuous rotamers and is able to reach lower-energy conformations [449].”
BackgroundOSPREY 3.0: Open-source protein redesign for you, with powerful new features
Hallen, M. A., Martin, J. W., Ojewole, A., Jou, J. D., Lowegard, A. U., Frenkel, M. S., Gainza, P., Nisonoff, H. M., Mukund, A., Wang, S., et al. (2018) · Journal of Computational Chemistry · doi:10.1002/jcc.25522 · Cited by 72
Self-citationRecent advances in automated protein design and its future challenges
Setiawan, D., Brender, J., & Zhang, Y. (2018) · Expert Opinion on Drug Discovery · doi:10.1080/17460441.2018.1465922 · Cited by 26
Protocol for Designing De Novo Noncanonical Peptide Binders in OSPREY
Childs, H., Guerin, N., Zhou, P., & Donald, B. R. (2024) · Journal of Computational Biology · doi:10.1089/cmb.2024.0669
Self-citation
Metadata
- Authors
- Gainza, P., Roberts, K. E., & Donald, B. R.
- Venue
- PLoS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2012-01-12
- Volume
- 8
- Issue
- 1
- Pages
- e1002335
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2034882714
- Cited by
- 101
- References
- 2
- FWCI
- 4.30
- Type
- journal article
- Language
- en
- Open access
- gold
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
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.