Finding the global minimum: A fuzzy end elimination implementation

Donald A. Keller, Masayuki Shibata, Emil Marcus, Rick L. Ornstein, Robert Rein

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

Abstract

The 'fuzzy end elimination theorem' (FEE) is a mathematically proven theorem that identifies rotameric states in proteins which are incompatible with the global minimum energy conformation. While implementing the FEE we noticed two different aspects that directly affected the final results at convergence. First, the identification of a single dead-ending rotameric state can trigger a 'domino effect' that initiates the identification of additional rotameric states which become dead-ending. A recursive check for deadending rotameric states is therefore necessary every time a dead-ending rotameric state is identified. It is shown that, if the recursive check is omitted, it is possible to miss the identification of some dead-ending rotameric states causing a premature termination of the elimination process. Second, we examined the effects of removing dead-ending rotameric states from further considerations at different moments of time. Two different methods of rotameric state removal were examined for an order dependence. In one case, each rotamer found to be incompatible with the global minimum energy conformation was removed immediately following its identification. In the other, dead-ending rotamers were marked for deletion but retained during the search, so that they influenced the evaluation of other rotameric states. When the search was completed, all marked rotamers were removed simultaneously. In addition, to expand further the usefulness of the FEE, a novel method is presented that allows for further reduction in the remaining set of conformations at the FEE convergence. In this method, called a tree-based search, each dead-ending pair of rotamers which does not lead to the direct removal of either rotameric state is used to reduce significantly the number of remaining conformations. In the future this method can also be expanded to triplet and quadruplet sets of rotameric states. We tested our implementation of the FEE by exhaustively searching ten protein segments and found that the FEE identified the global minimum every time. For each segment, the global minimum was exhaustively searched in two different environments: (i) the segments were extracted from the protein and exhaustively searched in the absence of the surrounding residues; (ii) the segments were exhaustively searched in the presence of the remaining residues fixed at crystal structure conformations. We also evaluated the performance of the method for accurately predicting side chain conformations. We examined the influence of factors such as type and accuracy of backbone template used, and the restrictions imposed by the choice of potential function, parameterization and rotamer database. Conclusions are drawn on these results and future prospects are given.

Original languageEnglish (US)
Pages (from-to)893-904
Number of pages12
JournalProtein Engineering, Design and Selection
Volume8
Issue number9
DOIs
StatePublished - Sep 1 1995
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Biotechnology
  • Bioengineering
  • Biochemistry
  • Molecular Biology

Keywords

  • Dead end elimination
  • Fuzzy end elimination
  • Global minimum
  • Protein side chains
  • Rotameric states

Fingerprint Dive into the research topics of 'Finding the global minimum: A fuzzy end elimination implementation'. Together they form a unique fingerprint.

Cite this