A search algorithm for fixed-composition protein design |
| |
Authors: | Hom Geoffrey K Mayo Stephen L |
| |
Institution: | Biochemistry and Molecular Biophysics Option, Division of Biology, California Institute of Technology, MC 114-96, 1200 E. California Blvd., Pasadena, California 91125, USA. |
| |
Abstract: | We present a computational protein design algorithm for finding low-energy sequences of fixed amino acid composition. The search algorithms used in protein design typically do not restrict amino acid composition. However, the random energy model of Shakhnovich suggests that the use of fixed-composition sequences may circumvent defects in the modeling of the denatured state. Our algorithm, FC_FASTER, links fixed-composition versions of Monte Carlo and the FASTER algorithm. As proof of principle, FC_FASTER was tested on an experimentally validated, full-sequence design of the beta1 domain of protein G. For the wild-type composition, FC_FASTER found a lower energy sequence than the experimentally validated sequence. Also, for a different composition, FC_FASTER found the hypothetical lowest-energy sequence in 14 out of 32 trials. |
| |
Keywords: | protein design fixed composition FASTER Monte Carlo protein G |
本文献已被 PubMed 等数据库收录! |
|