1995
DOI: 10.1093/protein/8.8.815
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced dead-end elimination in the search for the global minimum energy conformation of a collection of protein side chains

Abstract: Although the conformational states of protein side chains can be described using a library of rotamers, the determination of the global minimum energy conformation (GMEC) of a large collection of side chains, given fixed backbone coordinates, represents a challenging combinatorial problem with important applications in the field of homology modelling. Recently, we have developed a theoretical framework, called the dead-end elimination method, which allows us to identify efficiently rotamers that cannot be memb… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
72
0

Year Published

1998
1998
2007
2007

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 91 publications
(72 citation statements)
references
References 0 publications
0
72
0
Order By: Relevance
“…(41)(42)(43)(44)(45)(46) The Dunbrack and Karplus rotamer library (47) was used, augmented by rotamers at ± 10° of χ 1 and χ 2 for each rotamer. Hydroxyl groups on Ser, Thr and Tyr were sampled at ± 60° and 180°.…”
Section: Protein Design Methodologymentioning
confidence: 99%
“…(41)(42)(43)(44)(45)(46) The Dunbrack and Karplus rotamer library (47) was used, augmented by rotamers at ± 10° of χ 1 and χ 2 for each rotamer. Hydroxyl groups on Ser, Thr and Tyr were sampled at ± 60° and 180°.…”
Section: Protein Design Methodologymentioning
confidence: 99%
“…Rotamers were taken from the Dunbrack 2002 rotamer library [52]. We used our implementation of the dead end elimination (DEE) and A* branch and bound algorithms [53][54][55][56][57][58] to find the optimal structure for each sequence. Given this structure, we calculated its folding energy E f old repack using the potential used for repacking.…”
Section: Methodsmentioning
confidence: 99%
“…Two Monte Carlo searches were run-one using repacking, minimization, and re-evaluation according to E f old min;GB to score each sequence (direct design) and the other using CE equivalent of the same energy function (CE design). The DEE and A* branch and bound algorithms for repacking [53][54][55][56][57][58] were implemented in C. CHARMM [49] was used for continuous side-chain minimization and calculation of the van der Waals and EEF1 portions of the potential. PEP [60] was used to calculate atomic Born radii.…”
Section: Methodsmentioning
confidence: 99%
“…Furthermore, exact filtering algorithms, among them integer programming, 21 dead-end elimination (DEE), 12,13,23 and A*, 24 can advance the R 4 process by eliminating possibilities. 17 For example, in DEE the relative global energy, E global , of an IP is composed of the linear sum of the energy contributions from the backbone, the self and interaction with backbone energy, E(i r ), of rotamer, r, at its position, i, and its pairwise interaction energy with rotamer at nearby position, j: best case, arrangement of rotamer, i r , still has a higher energy than the maximum energy, or worst case, arrangement of an alternate rotamer, i t :…”
Section: Computational Filtering (Cf) Approachesmentioning
confidence: 99%