✍ Scribed by Chen Yanover; Menachem Fromer; Julia M. Shifman
No coin nor oath required. For personal study only.
Multistate protein design is the task of predicting the amino acid sequence that is best suited to selectively and stably fold to one state out of a set of competing structures. Computationally, it entails solving a challenging optimization problem. Therefore, notwithstanding the increased interest in multistate design, the only implementations reported are based on either genetic algorithms or Monte Carlo methods. The dead‐end elimination (DEE) theorem cannot be readily transfered to multistate design problems despite its successful application to single‐state protein design. In this article we propose a variant of the standard DEE, called type‐dependent DEE. Our method reduces the size of the conformational space of the multistate design problem, while provably preserving the minimal energy conformational assignment for any choice of amino acid sequence. Type‐dependent DEE can therefore be used as a preprocessing step in any computational multistate design scheme. We demonstrate the applicability of type‐dependent DEE on a set of multistate design problems and discuss its strength and limitations. © 2007 Wiley Periodicals, Inc. J Comput Chem, 2007
📜 SIMILAR VOLUMES
## Abstract Most of the methods that have been developed for computational protein design involve the selection of side‐chain conformations in the context of a single, fixed main‐chain structure. In contrast, multistate design (MSD) methods allow sequence selection to be driven by the energetic con
## Abstract Dead‐end elimination (DEE) has emerged as a powerful structure‐based, conformational search technique enabling computational protein redesign. Given a protein with __n__ mutable residues, the DEE criteria guide the search toward identifying the sequence of amino acids with the global mi