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 条
[21]  
Leaver-Fay A, 2007, J COMPUT CHEM, V28, P1336, DOI [10.1002/jcc.20626, 10.1002/jcc.206267]
[22]   INTERPRETATION OF PROTEIN STRUCTURES - ESTIMATION OF STATIC ACCESSIBILITY [J].
LEE, B ;
RICHARDS, FM .
JOURNAL OF MOLECULAR BIOLOGY, 1971, 55 (03) :379-&
[23]   RAPID APPROXIMATION TO MOLECULAR-SURFACE AREA VIA THE USE OF BOOLEAN LOGIC AND LOOK-UP TABLES [J].
LEGRAND, SM ;
MERZ, KM .
JOURNAL OF COMPUTATIONAL CHEMISTRY, 1993, 14 (03) :349-352
[24]   Side-chain modeling with an optimized scoring function [J].
Liang, SD ;
Grishin, NV .
PROTEIN SCIENCE, 2002, 11 (02) :322-331
[25]   Generalized dead-end elimination algorithms make large-scale protein side-chain structure prediction tractable: Implications for protein design and structural genomics [J].
Looger, LL ;
Hellinga, HW .
JOURNAL OF MOLECULAR BIOLOGY, 2001, 307 (01) :429-445
[26]   Computational sidechain placement and protein mutagenesis with implicit solvent models [J].
Lopes, Anne ;
Alexandrov, Alexey ;
Bathelt, Christine ;
Archontis, Georgios ;
Simonson, Thomas .
PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS, 2007, 67 (04) :853-867
[27]  
Lovell SC, 2000, PROTEINS, V40, P389, DOI 10.1002/1097-0134(20000815)40:3<389::AID-PROT50>3.0.CO
[28]  
2-2
[29]   OPUS-PSP: An orientation-dependent statistical all-atom potential derived from side-chain packing [J].
Lu, Mingyang ;
Dousis, Athanasios D. ;
Ma, Jianpeng .
JOURNAL OF MOLECULAR BIOLOGY, 2008, 376 (01) :288-301
[30]  
Mendes J, 1999, PROTEINS, V37, P530