OPUS‐Rota: A fast and accurate method for side‐chain modeling
Open Access
- 1 September 2008
- journal article
- Published by Wiley in Protein Science
- Vol. 17 (9) , 1576-1585
- https://doi.org/10.1110/ps.035022.108
Abstract
In this paper, we introduce a fast and accurate side-chain modeling method, named OPUS-Rota. In a benchmark comparison with the methods SCWRL, NCN, LGA, SPRUCE, Rosetta, and SCAP, OPUS-Rota is shown to be much faster than all the methods except SCWRL, which is comparably fast. In terms of overall χ 1 and χ 1+2 accuracies, however, OPUS-Rota is 5.4 and 8.8 percentage points better, respectively, than SCWRL. Compared with NCN, which has the best accuracy in the literature, OPUS-Rota is 1.6 percentage points better for overall χ 1+2 but 0.3 percentage points weaker for overall χ 1. Hence, our algorithm is much more accurate than SCWRL with similar execution speed, and it has accuracy comparable to or better than the most accurate methods in the literature, but with a runtime that is one or two orders of magnitude shorter. In addition, OPUS-Rota consistently outperforms SCWRL on the Wallner and Elofsson homology-modeling benchmark set when the sequence identity is greater than 40%. We hope that OPUS-Rota will contribute to high-accuracy structure refinement, and the computer program is freely available for academic users.Keywords
This publication has 50 references indexed in Scilit:
- OPUS-PSP: An Orientation-dependent Statistical All-atom Potential Derived from Side-chain PackingJournal of Molecular Biology, 2007
- IRECS: A new algorithm for the selection of most probable ensembles of side‐chain conformations in protein modelsProtein Science, 2007
- The dominant role of side‐chain backbone interactions in structural realization of amino acid code. ChiRotor: A side‐chain prediction algorithm based on side‐chain backbone interactionsProtein Science, 2007
- Prediction of side‐chain conformations on protein surfacesProteins-Structure Function and Bioinformatics, 2007
- Configurational‐bias sampling technique for predicting side‐chain conformations in proteinsProtein Science, 2006
- A graph‐theory algorithm for rapid protein side‐chain predictionProtein Science, 2003
- Generalized dead-end elimination algorithms make large-scale protein side-chain structure prediction tractable: implications for protein design and structural genomicsJournal of Molecular Biology, 2001
- Modeling of loops in protein structuresProtein Science, 2000
- Comparative Protein Modelling by Satisfaction of Spatial RestraintsJournal of Molecular Biology, 1993
- Solvation energy in protein folding and bindingNature, 1986