定向进化优化蛋白质工程搜索算法。

Richard Fox, Ajoy Roy, Sridhar Govindarajan, Jeremy Minshull, Claes Gustafsson, Jennifer T Jones, Robin Emig
{"title":"定向进化优化蛋白质工程搜索算法。","authors":"Richard Fox,&nbsp;Ajoy Roy,&nbsp;Sridhar Govindarajan,&nbsp;Jeremy Minshull,&nbsp;Claes Gustafsson,&nbsp;Jennifer T Jones,&nbsp;Robin Emig","doi":"10.1093/protein/gzg077","DOIUrl":null,"url":null,"abstract":"<p><p>An in silico protein model based on the Kauffman NK-landscape, where N is the number of variable positions in a protein and K is the degree of coupling between variable positions, was used to compare alternative search strategies for directed evolution. A simple genetic algorithm (GA) was used to model the performance of a standard DNA shuffling protocol. The search effectiveness of the GA was compared to that of a statistical approach called the protein sequence activity relationship (ProSAR) algorithm, which consists of two steps: model building and library design. A number of parameters were investigated and found to be important for the comparison, including the value of K, the screening size, the system noise and the number of replicates. The statistical model was found to accurately predict the measured activities for small values of the coupling between amino acids, K <or= 1. The ProSAR strategy was found to perform well for small to moderate values of coupling, 0 <or= K <or= 3, and was found to be robust to noise. Some implications for protein engineering are discussed.</p>","PeriodicalId":20902,"journal":{"name":"Protein engineering","volume":"16 8","pages":"589-97"},"PeriodicalIF":0.0000,"publicationDate":"2003-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/protein/gzg077","citationCount":"65","resultStr":"{\"title\":\"Optimizing the search algorithm for protein engineering by directed evolution.\",\"authors\":\"Richard Fox,&nbsp;Ajoy Roy,&nbsp;Sridhar Govindarajan,&nbsp;Jeremy Minshull,&nbsp;Claes Gustafsson,&nbsp;Jennifer T Jones,&nbsp;Robin Emig\",\"doi\":\"10.1093/protein/gzg077\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>An in silico protein model based on the Kauffman NK-landscape, where N is the number of variable positions in a protein and K is the degree of coupling between variable positions, was used to compare alternative search strategies for directed evolution. A simple genetic algorithm (GA) was used to model the performance of a standard DNA shuffling protocol. The search effectiveness of the GA was compared to that of a statistical approach called the protein sequence activity relationship (ProSAR) algorithm, which consists of two steps: model building and library design. A number of parameters were investigated and found to be important for the comparison, including the value of K, the screening size, the system noise and the number of replicates. The statistical model was found to accurately predict the measured activities for small values of the coupling between amino acids, K <or= 1. The ProSAR strategy was found to perform well for small to moderate values of coupling, 0 <or= K <or= 3, and was found to be robust to noise. Some implications for protein engineering are discussed.</p>\",\"PeriodicalId\":20902,\"journal\":{\"name\":\"Protein engineering\",\"volume\":\"16 8\",\"pages\":\"589-97\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1093/protein/gzg077\",\"citationCount\":\"65\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Protein engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/protein/gzg077\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Protein engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/protein/gzg077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 65

摘要

基于考夫曼nk景观的硅蛋白质模型,其中N是蛋白质中可变位置的数量,K是可变位置之间的耦合程度,用于比较定向进化的替代搜索策略。一个简单的遗传算法(GA)被用来模拟一个标准的DNA洗牌协议的性能。将遗传算法的搜索效率与蛋白质序列活性关系(ProSAR)算法的搜索效率进行了比较。ProSAR算法包括两个步骤:模型构建和库设计。研究了许多参数,发现对比较很重要,包括K值、筛选大小、系统噪声和重复次数。发现该统计模型可以准确地预测氨基酸、K和K之间偶联的小值的测定活性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimizing the search algorithm for protein engineering by directed evolution.

An in silico protein model based on the Kauffman NK-landscape, where N is the number of variable positions in a protein and K is the degree of coupling between variable positions, was used to compare alternative search strategies for directed evolution. A simple genetic algorithm (GA) was used to model the performance of a standard DNA shuffling protocol. The search effectiveness of the GA was compared to that of a statistical approach called the protein sequence activity relationship (ProSAR) algorithm, which consists of two steps: model building and library design. A number of parameters were investigated and found to be important for the comparison, including the value of K, the screening size, the system noise and the number of replicates. The statistical model was found to accurately predict the measured activities for small values of the coupling between amino acids, K

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信