A search algorithm for fixed-composition protein design

✍ Scribed by Geoffrey K. Hom; Stephen L. Mayo

• Publisher: John Wiley and Sons
• Year: 2005
• Tongue: English
• Weight: 63 KB
• Volume: 27
• Category: Article
• ISSN: 0192-8651
• DOI: 10.1002/jcc.20346

✦ Synopsis

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 β1 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. © 2005 Wiley Periodicals, Inc. J Comput Chem 27: 375–378, 2006