Evidence map›Paper›PMID 26825974›Full record

ArticleJournal of molecular modeling2016

A fast loop-closure algorithm to accelerate residue matching in computational enzyme design.

Jing Xue, Xiaoqiang Huang, Min Lin, Yushan Zhu

Abstract read
PubMed Publisher
In one paragraph

Article in Journal of molecular modeling, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

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

3 citing papers in PubMed.

  1. Article
  2. Article
  3. 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

4 authors.

Jing XueDepartment of Chemical Engineering, Tsinghua University, Beijing, 100084, People's Republic of China.
Xiaoqiang HuangDepartment of Chemical Engineering, Tsinghua University, Beijing, 100084, People's Republic of China.
Min LinDepartment of Chemical Engineering, Tsinghua University, Beijing, 100084, People's Republic of China.
Yushan ZhuDepartment of Chemical Engineering, Tsinghua University, Beijing, 100084, People's Republic of China. yszhu@tsinghua.edu.cn.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Constructing an active site on an inert scaffold is still a challenge in chemical biology. Herein, we describe the incorporation of a Newton-direction-based fast loop-closure algorithm for catalytic residue matching into our enzyme design program ProdaMatch. This was developed to determine the sites and geometries of the catalytic residues as well as the position of the transition state with high accuracy in order to satisfy the geometric constraints on the interactions between catalytic residues and the transition state. Loop-closure results for 64,827 initial loops derived from 21 loops in the test set showed that 99.51% of the initial loops closed to within 0.05 Å in fewer than 400 iteration steps, while the large majority of the initial loops closed within 100 iteration steps. The revised version of ProdaMatch containing the novel loop-closure algorithm identified all native matches for ten scaffolds in the native active-site recapitulation test. Its high speed and accuracy when matching catalytic residues with a scaffold make this version of ProdaMatch potentially useful for scaffold selection through the incorporation of more complex theoretical enzyme models which may yield higher initial activities in de novo enzyme design.

Indexed as

AlgorithmsCatalysisCatalytic DomainComputational BiologyEnzymesModels, MolecularProtein ConformationProtein EngineeringReproducibility of ResultsEnzymesComputational enzyme designLoop closure algorithmNumerical optimizationProtein design

Identifiers

What OpenQuestion holds

Textmetadata
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.