CoChat

The minimized dead‐end elimination criterion and its application to protein redesign in a hybrid scoring and search algorithm for computing partition functions over molecular ensembles

Open access
Georgiev, Ivelin, Lilien, Ryan H., Donald, Bruce R. · 2008 · Journal of Computational Chemistry
Cited by 136

The DOI matches its Crossref record.

Abstract

One of the main challenges for protein redesign is the efficient evaluation of a combinatorial number of candidate structures. The modeling of protein flexibility, typically by using a rotamer library of commonly‐observed low‐energy side‐chain conformations, further increases the complexity of the redesign problem. A dominant algorithm for protein redesign is dead‐end elimination (DEE), which prunes the majority of candidate conformations by eliminating rigid rotamers that provably are not part of the global minimum energy conformation (GMEC). The identified GMEC consists of rigid rotamers (i.e., rotamers that have not been energy‐minimized) and is thus referred to as the rigid‐GMEC. As a postprocessing step, the conformations that survive DEE may be energy‐minimized. When energy minimization is performed after pruning with DEE, the combined protein design process becomes heuristic, and is no longer provably accurate: a conformation that is pruned using rigid‐rotamer energies may subsequently minimize to a lower energy than the rigid‐GMEC. That is, the rigid‐GMEC and the conformation with the lowest energy among all energy‐minimized conformations (the minimized‐GMEC) are likely to be different. While the traditional DEE algorithm succeeds in not pruning rotamers that are part of the rigid‐GMEC, it makes no guarantees regarding the identification of the minimized‐GMEC. In this paper we derive a novel, provable, and efficient DEE‐like algorithm, called minimized‐DEE (MinDEE), that guarantees that rotamers belonging to the minimized‐GMEC will not be pruned, while still pruning a combinatorial number of conformations. We show that MinDEE is useful not only in identifying the minimized‐GMEC, but also as a filter in an ensemble‐based scoring and search algorithm for protein redesign that exploits energy‐minimized conformations. We compare our results both to our previous computational predictions of protein designs and to biological activity assays of predicted protein mutants. Our provable and efficient minimized‐DEE algorithm is applicable in protein redesign, protein‐ligand binding prediction, and computer‐aided drug design. © 2008 Wiley Periodicals, Inc. J Comput Chem, 2008

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.1002/jcc.20909

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.

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

Cited by

See all 136

Metadata

Authors
Georgiev, I., Lilien, R. H., & Donald, B. R.
Venue
Journal of Computational Chemistry
Publisher
Wiley
Published
2008-05-27
Volume
29
Issue
10
Pages
1527-1542
ISSN
  • 0192-8651 (ISSN-L)
  • 1096-987X
OpenAlex
W1980703922
Cited by
136
References
0
FWCI
3.60
Type
journal article
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: The minimized dead‐end elimination criterion and its application to protein redesign in a hybrid scoring and search algorithm for computing partition functions over molecular ensembles. https://app.cochat.ai/papers/10.1002/jcc.20909
The paper
Georgiev, I., Lilien, R. H., & Donald, B. R. (2008). The minimized dead‐end elimination criterion and its application to protein redesign in a hybrid scoring and search algorithm for computing partition functions over molecular ensembles. Journal of Computational Chemistry. https://doi.org/10.1002/jcc.20909

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.