Exact rotamer optimization for protein design

被引:99
作者
Gordon, DB
Hom, GK
Mayo, SL
Pierce, NA [1 ]
机构
[1] CALTECH, Dept Appl & Computat Math, Pasadena, CA 91125 USA
[2] Whitehead Inst Biomed Res, Cambridge, MA 02142 USA
[3] CALTECH, Howard Hughes Med Inst, Pasadena, CA 91125 USA
[4] CALTECH, Div Biol, Pasadena, CA 91125 USA
关键词
dead-end elimination; side-chain placement; protein design; combinatorial optimization; NP-hard;
D O I
10.1002/jcc.10121
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Computational methods play a central role in the rational design of novel proteins. The present work describes a new hybrid exact rotamer optimization (HERO) method that builds on previous, dead-end elimination algorithms to yield dramatic performance enhancements. Measured on experimentally validated physical models. improvements make it possible to perform previously intractable designs of entire protein core, surface, or boundary regions. Computational demonstrations include a full core design of the variable domains of the light and heavy chains of catalytic antibody 48G7 FAB with 74 residues and 10(128) conformations a full core/boundary design of the beta1 domain of protein G with 25 residues and 10(53) conformations, and a full surface design of the beta1 domain of protein G with 27 residues and 10(60) conformations. In addition, a full sequence design of the beta1 domain of protein G is used to demonstrate the strong dependence of algorithm performance on the exact form of the potential function and the fidelity of the rotamer library. These results emphasize that search algorithm performance for protein design can only be meaningfully evaluated on physical models that have been subjected to experimental scrutiny. The neck algorithm greatly facilitates ongoing efforts to engineer increasingly complex protein features. (C) 2002 Wiley Periodicals, Inc.
引用
收藏
页码:232 / 243
页数:12
相关论文
共 51 条