OPUS-Rota: A fast and accurate method for side-chain modeling

被引:45
作者
Lu, Mingyang [1 ]
Dousis, Athanasios D. [2 ]
Ma, Jianpeng [1 ,2 ]
机构
[1] Baylor Coll Med, Verna & Marrs McLean Dept Biochem & Mol Biol, Houston, TX 77030 USA
[2] Rice Univ, Dept Bioengn, Houston, TX 77005 USA
基金
美国国家科学基金会; 美国国家卫生研究院;
关键词
rotamers; side-chain modeling; structure prediction; high-accuracy refinement;
D O I
10.1110/ps.035022.108
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
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 chi(1) and chi(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 chi(1+2) but 0.3 percentage points weaker for overall chi(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.
引用
收藏
页码:1576 / 1585
页数:10
相关论文
共 50 条
[1]   A graph-theory algorithm for rapid protein side-chain prediction [J].
Canutescu, AA ;
Shelenkov, AA ;
Dunbrack, RL .
PROTEIN SCIENCE, 2003, 12 (09) :2001-2014
[2]   A semidefinite programming approach to side chain positioning with new rounding strategies [J].
Chazelle, B ;
Kingsford, C ;
Singh, M .
INFORMS JOURNAL ON COMPUTING, 2004, 16 (04) :380-392
[3]   A merge-decoupling dead end elimination algorithm for protein side-chain conformation [J].
Chong, Ket Fah ;
Leong, Hon Wai .
INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS, 2007, 1 (04) :372-388
[4]  
DeMaeyer M, 1997, FOLD DES, V2, P53
[5]   Fast and Accurate Side-Chain Topology and Energy Refinement (FASTER) as a new method for protein structure optimization [J].
Desmet, J ;
Spriet, J ;
Lasters, I .
PROTEINS-STRUCTURE FUNCTION AND GENETICS, 2002, 48 (01) :31-43
[6]   BACKBONE-DEPENDENT ROTAMER LIBRARY FOR PROTEINS - APPLICATION TO SIDE-CHAIN PREDICTION [J].
DUNBRACK, RL ;
KARPLUS, M .
JOURNAL OF MOLECULAR BIOLOGY, 1993, 230 (02) :543-574
[7]   Bayesian statistical analysis of protein side-chain rotamer preferences [J].
Dunbrack, RL ;
Cohen, FE .
PROTEIN SCIENCE, 1997, 6 (08) :1661-1681
[8]   SOLVATION ENERGY IN PROTEIN FOLDING AND BINDING [J].
EISENBERG, D ;
MCLACHLAN, AD .
NATURE, 1986, 319 (6050) :199-203
[9]   Importance of solvent accessibility and contact surfaces in modeling side-chain conformations in proteins [J].
Eyal, E ;
Najmanovich, R ;
McConkey, BJ ;
Edelman, M ;
Sobolev, V .
JOURNAL OF COMPUTATIONAL CHEMISTRY, 2004, 25 (05) :712-724
[10]   Modeling of loops in protein structures [J].
Fiser, A ;
Do, RKG ;
Sali, A .
PROTEIN SCIENCE, 2000, 9 (09) :1753-1773