Evidence map›Paper›PMID 34178420›Full record

ArticleACS catalysis2020

Combinatorial Approach for Exploring Conformational Space and Activation Barriers in Computer-Aided Enzyme Design.

Dibyendu Mondal, Vesselin Kolev, Arieh Warshel

Abstract read
In one paragraph

Article in ACS catalysis, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.

0numbers the graph read from it
0cells of the map it votes in
8citing 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

8 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Enzyme Engineering Strategies for the Bioenhancement of L-Asparaginase Used as a Biopharmaceutical.BioDrugs : clinical immunotherapeutics, biopharmaceuticals and gene therapy · 2023
    Review
  6. Article
  7. Enhancing computational enzyme design by a maximum entropy strategy.Proceedings of the National Academy of Sciences of the United States of America · 2022
    Article
  8. Review
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.

Dibyendu MondalDepartment of Chemistry, University of Southern California, Los Angeles, California 90089, United States.ORCID 0000-0002-5047-6985
Vesselin KolevDepartment of Chemistry, University of Southern California, Los Angeles, California 90089, United States.
Arieh WarshelDepartment of Chemistry, University of Southern California, Los Angeles, California 90089, United States.ORCID 0000-0001-7971-5401

Funding

Multiscale Simulations of Biological Systems and ProcessesR35GM122472 · NIGMS · UNIVERSITY OF SOUTHERN CALIFORNIA · PI ARIEH WARSHEL · 2017 to 2026
$5.0M
NIGMS NIH HHS R35 GM122472
6 · The paper itself

Abstract

Computer-aided enzyme design is a field of great potential importance for biotechnological applications, medical advances, and a fundamental understanding of enzyme action. However, reaching a predictive ability in this direction is extremely challenging. It requires both the ability to predict quantitatively the activation barriers in cases where the structure and sequence are known and the ability to predict the effect of different mutations. In this work, we propose a protocol for predicting reasonable starting structures of mutants of proteins with known structures and for calculating the activation barriers of the generated mutants. Our approach also allows us to use the predicted structures of the generated mutant to predict structures and activation barriers for subsequent set of mutations. This protocol is used to examine the reliability of the

Indexed as

computer-aided enzyme designdehalogenasedirected evolutiondistinct rotamer generationempirical valence bondKemp eliminase

Identifiers

PMID34178420
PMCPMC8225234

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.