Optimization of Combinatorial Mutagenesis

被引:0
|
作者
Parker, Andrew S. [1 ]
Griswold, Karl E. [2 ]
Bailey-Kellogg, Chris [1 ]
机构
[1] Dartmouth Coll, Dept Comp Sci, 6211 Sudikoff Lab, Hanover, NH 03755 USA
[2] Dartmouth Coll, Thayer Sch Engn, Hanover, NH 03755 USA
关键词
PROTEIN DESIGN; RECOMBINATION; LIBRARIES; ALGORITHMS; DIVERSITY; EVOLUTION;
D O I
暂无
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Protein engineering by combinatorial site-directed mutagenesis evaluates a portion of the sequence space near a target protein, seeking variants with improved properties (stability, activity, immunogenicity, etc.). In order to improve the hit-rate of beneficial variants in such mutagenesis libraries, we develop methods to select optimal positions and corresponding sets of the mutations that will be used, in all combinations, in constructing a library for experimental evaluation. Our approach, OCoM (Optimization of Combinatorial Mutagenesis), encompasses both degenerate oligonucleotides and specified point mutations, and can be directed accordingly by requirements of experimental cost and library size. It evaluates the quality of the resulting library by one- and two-body sequence potentials, averaged over the variants. To ensure that it is not simply recapitulating extant sequences, it balances the quality of a library with an explicit evaluation of the novelty of its members. We show that, despite dealing with a combinatorial set of variants, in our approach the resulting library optimization problem is actually isomorphic to single-variant optimization. By the same token, this means that the two-body sequence potential results in an NP-hard optimization problem. We present an efficient dynamic programming algorithm for the one-body case and a practically-efficient integer programming approach for the general two-body case. We demonstrate the effectiveness of our approach in designing libraries for three different case study proteins targeted by previous combinatorial libraries a green fluorescent protein, a cytochrome P450, and a beta lactamase. We found that OCoM worked quite efficiently in practice, requiring only 1 hour even for the massive design problem of selecting 18 mutations to generate 107 variants of a 443-residue P450. We demonstrate the general ability of OCoM in enabling the protein engineer to explore and evaluate trade-offs between quality and novelty as well as library construction technique, and identify optimal libraries for experimental evaluation.
引用
收藏
页码:321 / +
页数:3
相关论文
共 50 条
  • [21] Metaheuristics in combinatorial optimization
    Gendreau, M
    Potvin, JY
    ANNALS OF OPERATIONS RESEARCH, 2005, 140 (01) : 189 - 213
  • [22] Combinatorial mesh optimization
    Vincent Vidal
    Christian Wolf
    Florent Dupont
    The Visual Computer, 2012, 28 : 511 - 525
  • [23] COMBINATORIAL OPTIMIZATION - BIBLIOGRAPHY
    不详
    MATHEMATICAL PROGRAMMING STUDY, 1980, 12 (APR): : 214 - 221
  • [24] Convex Combinatorial Optimization
    Shmuel Onn
    Uriel G. Rothblum
    Discrete & Computational Geometry, 2004, 32 : 549 - 566
  • [25] A METHOD OF COMBINATORIAL OPTIMIZATION
    PLOTNIKOV, AD
    DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1981, (02): : 25 - 28
  • [26] Combinatorial Optimization Preface
    de Werra, Dominique
    Maculan, Nelson
    Mahjoub, A. Ridha
    DISCRETE APPLIED MATHEMATICS, 2014, 164 : 1 - 1
  • [27] COMBINATORIAL OPTIMIZATION IN BIOLOGY
    WARNOW, T
    IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE, 1993, 12 (02): : 91 - 92
  • [28] MINMAX COMBINATORIAL OPTIMIZATION
    PUNNEN, AP
    ANEJA, YP
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 81 (03) : 634 - 643
  • [29] Convex combinatorial optimization
    Onn, S
    Rothblum, UG
    DISCRETE & COMPUTATIONAL GEOMETRY, 2004, 32 (04) : 549 - 566
  • [30] Integer and combinatorial optimization
    Zilinskas, A
    INTERFACES, 2000, 30 (06) : 110 - 112