首页> 外文学位 >Optimization algorithms for site-directed protein recombination experiment planning.
【24h】

Optimization algorithms for site-directed protein recombination experiment planning.

机译:定点蛋白质重组实验计划的优化算法。

获取原文
获取原文并翻译 | 示例

摘要

Site-directed protein recombination produces improved and novel protein variants by recombining sequence fragments from parent proteins. The resulting hybrids accumulate multiple mutations that have been evolutionarily accepted together. Subsequent screening or selection identifies hybrids with desirable characteristics. In order to increase the "hit rate" of good variants, this thesis develops experiment planning algorithms to optimize protein recombination experiments. First, to improve the frequency of generating novel hybrids, a metric is developed to assess the diversity among hybrids and parent proteins. Dynamic programming algorithms are then created to optimize the selection of breakpoint locations according to this metric. Second, the trade-off between diversity and stability in recombination experiment planning is studied, recognizing that diversity requires changes from parent proteins, which may also disrupt important residue interactions necessary for protein stability. Accordingly, methods based on dynamic programming are developed to provide combined optimization of diversity and stability, finding optimal breakpoints such that no other experiment plan has better performance in both aspects simultaneously. Third, in order to support protein recombination with heterogeneous structures and focus on functionally important regions, a general framework for protein fragment swapping is developed. Differentiating source and target parents, and swappable regions within them, fragment swapping enables asymmetric, selective site-directed recombination. Two applications of protein fragment swapping are studied. In order to generate hybrids inheriting functionalities from both source and target proteins by fragment swapping, a method based on integer programming selects optimal swapping fragments to maximize the predicted stability and activity of hybrids in the resulting library. In another application, human source protein fragments are swapped into therapeutic exogenous target protein to minimize the occurrence of peptides that trigger immune response. A dynamic programming method is developed to optimize fragment selection for both humanity and functionality, resulting in therapeutically active variants with decreased immunogenicity.
机译:定点蛋白质重组可通过重组亲本蛋白质的序列片段来产生改良的新型蛋白质变异体。所得的杂种积累了多个突变,这些突变已一起进化接受。随后的筛选或选择鉴定出具有所需特性的杂种。为了提高良好变异的“命中率”,本文开发了优化蛋白质重组实验的实验计划算法。首先,为了提高产生新杂种的频率,开发了一种指标来评估杂种和亲本蛋白之间的多样性。然后创建动态编程算法,以根据此指标优化对断点位置的选择。其次,研究了重组实验计划中多样性与稳定性之间的权衡,认识到多样性需要母体蛋白质的变化,这也可能破坏蛋白质稳定性所必需的重要残基相互作用。因此,开发了基于动态编程的方法,以提供多样性和稳定性的组合优化,找到最佳断点,以使其他实验计划无法同时在两个方面都具有更好的性能。第三,为了支持具有异质结构的蛋白质重组并关注功能上重要的区域,开发了蛋白质片段交换的通用框架。通过区分源和目标亲本以及其中的可交换区域,片段交换可实现不对称的,选择性的定点重组。研究了蛋白质片段交换的两种应用。为了通过片段交换产生从源蛋白和靶蛋白两者继承功能性的杂种,基于整数编程的方法选择最佳交换片段,以使所得文库中杂种的预测稳定性和活性最大化。在另一个应用中,人类源蛋白片段被交换成治疗性外源靶蛋白,以最小化触发免疫反应的肽的出现。开发了一种动态程序设计方法,以优化针对人类和功能的片段选择,从而产生具有免疫原性降低的治疗活性变体。

著录项

  • 作者

    Zheng, Wei.;

  • 作者单位

    Dartmouth College.;

  • 授予单位 Dartmouth College.;
  • 学科 Biology Bioinformatics.;Computer Science.
  • 学位 Ph.D.
  • 年度 2010
  • 页码 150 p.
  • 总页数 150
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号