Evidence map›Paper›PMID 22821798›Full record

ArticleProteins2013

Dead-end elimination with perturbations (DEEPer): a provable protein design algorithm with continuous sidechain and backbone flexibility.

Mark A Hallen, Daniel A Keedy, Bruce R Donald

Abstract read
In one paragraph

Article in Proteins, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 40 papers.

0numbers the graph read from it
0cells of the map it votes in
40citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

40 citing papers in PubMed.

  1. Article
  2. Protocol for DesigningJournal of computational biology : a journal of computational molecular cell biology · 2024
    Article
  3. Article
  4. Knowledge-Based Unfolded State Model for Protein Design.Methods in molecular biology (Clifton, N.J.) · 2022
    Article
  5. Article
  6. Article
  7. Article
  8. Review
  9. Minimization-Aware RecursiveJournal of computational biology : a journal of computational molecular cell biology · 2020
    Article
  10. Article
  11. Protein Design by Provable Algorithms.Communications of the ACM · 2019
    Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Data driven flexible backbone protein design.PLoS computational biology · 2017
    Article
  18. Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Mark A HallenDepartment of Biochemistry, Duke University Medical Center, Durham, North Carolina, USA.
Daniel A Keedy
Bruce R Donald

Funding

Computational Structure-Based Protein DesignR01GM078031 · NIGMS · DUKE UNIVERSITY · PI DONALD, BRUCE R. · 2008 to 2021
$4.3M
Structural Biology and Biphysics Training ProgramT32GM008487 · NIGMS · DUKE UNIVERSITY · PI OAS, TERRENCE GILBERT · 1994 to 2014
$2.9M
New Kind of Quality Management for X-ray &NMR ModelsR01GM073930 · NIGMS · DUKE UNIVERSITY · PI RICHARDSON, DAVID CLAUDE · 2005 to 2013
$2.3M
NIGMS NIH HHS R01 GM-073930NIGMS NIH HHS R01 GM073930NIGMS NIH HHS R01 GM078031NIGMS NIH HHS R01 GM-78031
6 · The paper itself

Abstract

Computational protein and drug design generally require accurate modeling of protein conformations. This modeling typically starts with an experimentally determined protein structure and considers possible conformational changes due to mutations or new ligands. The DEE/A* algorithm provably finds the global minimum-energy conformation (GMEC) of a protein assuming that the backbone does not move and the sidechains take on conformations from a set of discrete, experimentally observed conformations called rotamers. DEE/A* can efficiently find the overall GMEC for exponentially many mutant sequences. Previous improvements to DEE/A* include modeling ensembles of sidechain conformations and either continuous sidechain or backbone flexibility. We present a new algorithm, DEEPer (Dead-End Elimination with Perturbations), that combines these advantages and can also handle much more extensive backbone flexibility and backbone ensembles. DEEPer provably finds the GMEC or, if desired by the user, all conformations and sequences within a specified energy window of the GMEC. It includes the new abilities to handle arbitrarily large backbone perturbations and to generate ensembles of backbone conformations. It also incorporates the shear, an experimentally observed local backbone motion never before used in design. Additionally, we derive a new method to accelerate DEE/A*-based calculations, indirect pruning, that is particularly useful for DEEPer. In 67 benchmark tests on 64 proteins, DEEPer consistently identified lower-energy conformations than previous methods did, indicating more accurate modeling. Additional tests demonstrated its ability to incorporate larger, experimentally observed backbone conformational changes and to model realistic conformational ensembles. These capabilities provide significant advantages for modeling protein mutations and protein-ligand interactions.

Indexed as

AlgorithmsComputational BiologyDatabases, ProteinEntropyModels, MolecularProtein ConformationProteinsSoftwareProteins

Identifiers

PMID22821798
PMCPMC3491125

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.