A novel ensemble-based scoring and search algorithm for protein redesign and its application to modify the substrate specificity of the gramicidin synthetase a phenylalanine adenylation enzyme.
Realization of novel molecular function requires the ability to alter molecular complex formation. Enzymatic function can be altered by changing enzyme-substrate interactions via modification of an enzyme's active site. A redesigned enzyme may either perform a novel reaction on its native substrates or its native reaction on novel substrates. A number of computational approaches have been developed to address the combinatorial nature of the protein redesign problem. These approaches typically search for the global minimum energy conformation among an exponential number of protein conformations. We present a novel algorithm for protein redesign, which combines a statistical mechanics-derived ensemble-based approach to computing the binding constant with the speed and completeness of a branch-and-bound pruning algorithm. In addition, we developed an efficient deterministic approximation algorithm, capable of approximating our scoring function to arbitrary precision. In practice, the approximation algorithm decreases the execution time of the mutation search by a factor of ten. To test our method, we examined the Phe-specific adenylation domain of the nonribosomal peptide synthetase gramicidin synthetase A (GrsA-PheA). Ensemble scoring, using a rotameric approximation to the partition functions of the bound and unbound states for GrsA-PheA, is first used to predict binding of the wildtype protein and a previously described mutant (selective for leucine), and second, to switch the enzyme specificity toward leucine, using two novel active site sequences computationally predicted by searching through the space of possible active site mutations. The top scoring in silico mutants were created in the wetlab and dissociation/binding constants were determined by fluorescence quenching. These tested mutations exhibit the desired change in specificity from Phe to Leu. Our ensemble-based algorithm, which flexibly models both protein and ligand using rotamer-based partition functions, has application in enzyme redesign, the prediction of protein-ligand binding, and computer-aided drug design.
Lilien
Ryan H
RH
Computer Science Department, Dartmouth College, Hanover, NH 03755, USA.
Stevens
Brian W
BW
Anderson
Amy C
AC
Donald
Bruce R
BR
D000255:Adenosine Triphosphate / Q000378:metabolism; D000465:Algorithms; D000591:Amino Acid Isomerases / Q000235:genetics* / Q000378:metabolism*; D001665:Binding Sites; D003460:Crystallization; D006096:Gramicidin / Q000378:metabolism*; D008024:Ligands; D008958:Models, Molecular; D009154:Mutation / Q000502:physiology*; D010649:Phenylalanine / Q000378:metabolism; D011485:Protein Binding; D011487:Protein Conformation; D012270:Ribosomes / Q000378:metabolism; D013379:Substrate Specificity
D008024:Ligands; D006096:Gramicidin; D010649:Phenylalanine; D000255:Adenosine Triphosphate; D000591:Amino Acid Isomerases; C022343:phenylalanine racemase (ATP-hydrolyzing)