Related Experiment Videos
Finding the global minimum: a fuzzy end elimination implementation
D A Keller1, M Shibata, E Marcus
1Department of Biophysics, Roswell Park Cancer Institute, Buffalo, NY 14263, USA.
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 dead-ending 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.
Insights
The fuzzy end elimination theorem (FEE) requires recursive checks to accurately identify all dead-ending protein rotameric states. Implementing recursive checks and simultaneous removal of dead-ending rotamers improves protein structure prediction accuracy.
Area of Science:
- Computational Biology
- Structural Bioinformatics
- Protein Science
Background:
- The fuzzy end elimination theorem (FEE) is a computational method for identifying protein rotameric states incompatible with the global minimum energy conformation.
- Accurate protein structure prediction relies on efficient elimination of energetically unfavorable rotamers.
Purpose of the Study:
- To investigate the impact of recursive checks for dead-ending rotameric states within the FEE.
- To evaluate different strategies for removing dead-ending rotamers and their effect on the search process.
- To introduce a novel tree-based search method for further reducing conformational space at FEE convergence.
Main Methods:
- Implementation and testing of the fuzzy end elimination theorem (FEE) with and without recursive checks for dead-ending rotameric states.
- Comparison of immediate versus simultaneous removal of dead-ending rotamers.
- Development and application of a tree-based search method for conformational space reduction.
- Exhaustive conformational searching of ten protein segments in two different environments.
Main Results:
- Recursive checks are essential to prevent the 'domino effect' from causing premature termination of the FEE process.
- Simultaneous removal of dead-ending rotamers, compared to immediate removal, demonstrated order dependence in results.
- The novel tree-based search method significantly reduced the number of remaining conformations.
- The FEE successfully identified the global minimum energy conformation for all tested protein segments under various conditions.
Conclusions:
- Recursive identification and handling of dead-ending rotameric states are crucial for the accurate and complete application of the fuzzy end elimination theorem.
- The developed tree-based search offers a promising avenue for enhancing the efficiency of protein structure prediction algorithms.
- The FEE method, when implemented with these improvements, demonstrates robust performance in identifying global minimum energy conformations and predicting side chain conformations.