Optimization of van der Waals Energy for Protein Side-Chain Placement and Design

被引:6
作者
Fahmy, Amr [1 ]
Wagner, Gerhard [1 ]
机构
[1] Harvard Univ, Sch Med, Boston, MA 02115 USA
基金
美国国家卫生研究院;
关键词
DEPENDENT ROTAMER LIBRARY; PREDICTION; ALGORITHMS;
D O I
10.1016/j.bpj.2011.07.052
中图分类号
Q6 [生物物理学];
学科分类号
071011 ;
摘要
Computational determination of optimal side-chain conformations in protein structures has been a long-standing and challenging problem. Solving this problem is important for many applications including homology modeling, protein docking, and for placing small molecule ligands on protein-binding sites. Programs available as of this writing are very fast and reasonably accurate, as measured by deviations of side-chain dihedral angles; however, often due to multiple atomic clashes, they produce structures with high positive energies. This is problematic in applications where the energy values are important, for example when placing small molecules in docking applications; the relatively small binding energy of the small molecule is drowned by the large energy due to atomic clashes that hampers finding the lowest energy state of the docked ligand. To address this we have developed an algorithm for generating a set of side-chain conformations that is dense enough that at least one of its members would have a root mean-square deviation of no more than R A from any possible side-chain conformation of the amino acid. We call such a set a side-chain cover set of order R for the amino acid. The size of the set is constrained by the energy of the interaction of the side chain to the backbone atoms. Then, side-chain cover sets are used to optimize the conformation of the side chains given the coordinates of the backbone of a protein. The method we use is based on a variety of dead-end elimination methods and the recently discovered dynamic programming algorithm for this problem. This was implemented in a computer program called Octopus where we use side-chain cover sets with very small values for R, such as 0.1 angstrom, which ensures that for each amino-acid side chain the set contains a conformation with a root mean-square deviation of, at most, R from the optimal conformation. The side-chain dihedral-angle accuracy of the program is comparable to other implementations; however, it has the important advantage that the structures produced by the program have negative energies that are very close to the energies of the crystal structure for all tested proteins.
引用
收藏
页码:1690 / 1698
页数:9
相关论文
共 28 条
[1]  
[Anonymous], 2010, The PyMOL Molecular Graphics System (2.5.4)
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[3]   COMPLEXITY OF FINDING EMBEDDINGS IN A K-TREE [J].
ARNBORG, S ;
CORNEIL, DG ;
PROSKUROWSKI, A .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (02) :277-284
[4]  
Bellman R. E., 1957, Dynamic programming. Princeton landmarks in mathematics
[5]   Mitochondrial uncoupling protein 2 structure determined by NMR molecular fragment searching [J].
Berardi, Marcelo J. ;
Shih, William M. ;
Harrison, Stephen C. ;
Chou, James J. .
NATURE, 2011, 476 (7358) :109-113
[6]  
Berry A, 2003, LECT NOTES COMPUT SC, V2880, P58
[7]   Prediction of protein side-chain rotamers from a backbone-dependent rotamer library: A new homology modeling tool [J].
Bower, MJ ;
Cohen, FE ;
Dunbrack, RL .
JOURNAL OF MOLECULAR BIOLOGY, 1997, 267 (05) :1268-1282
[8]   A graph-theory algorithm for rapid protein side-chain prediction [J].
Canutescu, AA ;
Shelenkov, AA ;
Dunbrack, RL .
PROTEIN SCIENCE, 2003, 12 (09) :2001-2014
[9]   THE DEAD-END ELIMINATION THEOREM AND ITS USE IN PROTEIN SIDE-CHAIN POSITIONING [J].
DESMET, J ;
DEMAEYER, M ;
HAZES, B ;
LASTERS, I .
NATURE, 1992, 356 (6369) :539-542
[10]   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