Computational method to reduce the search space for directed protein evolution
AUTOR(ES)
Voigt, Christopher A.
FONTE
The National Academy of Sciences
RESUMO
We introduce a computational method to optimize the in vitro evolution of proteins. Simulating evolution with a simple model that statistically describes the fitness landscape, we find that beneficial mutations tend to occur at amino acid positions that are tolerant to substitutions, in the limit of small libraries and low mutation rates. We transform this observation into a design strategy by applying mean-field theory to a structure-based computational model to calculate each residue's structural tolerance. Thermostabilizing and activity-increasing mutations accumulated during the experimental directed evolution of subtilisin E and T4 lysozyme are strongly directed to sites identified by using this computational approach. This method can be used to predict positions where mutations are likely to lead to improvement of specific protein properties.
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=31129Documentos Relacionados
- A gradient-directed Monte Carlo method for global optimization in a discrete space: Application to protein sequence design and folding
- A method for directed evolution and functional cloning of enzymes
- eCodonOpt: a systematic computational framework for optimizing codon usage in directed evolution experiments
- Search for computational modules in the C. elegans brain
- Sequence saturation mutagenesis (SeSaM): a novel method for directed evolution
