Computational Feasibility of an Exhaustive Search of Side‐Chain Conformations in Protein‐Protein Docking
- 15 September 2018
- journal article
- research article
- Published by Wiley in Journal of Computational Chemistry
- Vol. 39 (24) , 2012-2021
Abstract
Protein‐protein docking procedures typically perform the global scan of the proteins relative positions, followed by the local refinement of the putative matches. Because of the size of the search space, the global scan is usually implemented as rigid‐body search, using computationally inexpensive intermolecular energy approximations. An adequate refinement has to take into account structural flexibility. Since the refinement performs conformational search of the interacting proteins, it is extremely computationally challenging, given the enormous amount of the internal degrees of freedom. Different approaches limit the search space by restricting the search to the side chains, rotameric states, coarse‐grained structure representation, principal normal modes, and so on. Still, even with the approximations, the refinement presents an extreme computational challenge due to the very large number of the remaining degrees of freedom. Given the complexity of the search space, the advantage of the exhaustive search is obvious. The obstacle to such search is computational feasibility. However, the growing computational power of modern computers, especially due to the increasing utilization of Graphics Processing Unit (GPU) with large amount of specialized computing cores, extends the ranges of applicability of the brute‐force search methods. This proof‐of‐concept study demonstrates computational feasibility of an exhaustive search of side‐chain conformations in protein pocking. The procedure, implemented on the GPU architecture, was used to generate the optimal conformations in a large representative set of protein‐protein complexes.Keywords
Funding Information
- National Institutes of Health (R01GM074255)
- National Science Foundation (DBI1262621, DBI1565107, CNS133789)
This publication has 43 references indexed in Scilit:
- osprey2013
- Accelerated protein structure comparison using TM-score-GPUBioinformatics, 2012
- Fast and accurate prediction of protein side-chain conformationsBioinformatics, 2011
- Protein side chain modeling with orientation‐dependent atomic force fields derived by series expansionsJournal of Computational Chemistry, 2011
- Improved prediction of protein side‐chain conformations with SCWRL4Proteins: Structure, Function, and Bioinformatics, 2009
- Computational structure-based redesign of enzyme activityProceedings of the National Academy of Sciences, 2009
- OPUS‐Rota: A fast and accurate method for side‐chain modelingProtein Science, 2008
- The minimized dead‐end elimination criterion and its application to protein redesign in a hybrid scoring and search algorithm for computing partition functions over molecular ensemblesJournal of Computational Chemistry, 2008
- IRECS: A new algorithm for the selection of most probable ensembles of side‐chain conformations in protein modelsProtein Science, 2007
- Prediction of side‐chain conformations on protein surfacesProteins: Structure, Function, and Bioinformatics, 2007