Constructing and Analyzing the Fitness Landscape of an Experimental Evolutionary Process

被引:65
|
作者
Reetz, Manfred T. [1 ]
Sanchis, Joaquin [1 ]
机构
[1] Max Planck Inst Kohlenforsch, D-45470 Mulheim, Germany
关键词
directed evolution; enantioselectivity; evolutionary pathways; fitness landscape; saturation mutagenesis;
D O I
10.1002/cbic.200800371
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Iterative saturation mutagenesis (ISM) is a promising approach to more efficient directed evolution, especially for enhancing the enantioselectivity and/or thermostability of enzymes. This was demonstrated previously for on epoxide hydrolase (EH), after five sets of mutations led to a stepwise increase in enantioselectivity. This study utilizes these results to illuminate the nature of ISM, and identify the reasons for its operational efficacy. By applying a deconvolution strategy to the five sets of mutations and measuring the enantioselectivity factors (E) of the EH variants, Delta Delta G(double dagger) values become accessible. With these values, the construction of the complete fitness-pathway landscape is possible. The free energy profiles of the 5!= 120 evolutionary pathways leading from the wild-type to. the best mutant show that 55 trajectories are energetically favored, one of which is the originally observed route. This particular pathway was analyzed in terms of epistatic effects operating between the sets of mutations at all evolutionary stages. The degree of synergism increases as the stepwise evolutionary process proceeds. When encountering a local minimum in a disfavored pathway, that is, in the case of a dead end, choosing another set of mutations at a previous stage puts the evolutionary process back on an energetically favored trajectory. The type of analysis presented here might be useful when evaluating other mutagenesis methods and strategies in directed evolution.
引用
收藏
页码:2260 / 2267
页数:8
相关论文
共 50 条
  • [21] Inclusion of the fitness sharing technique in an evolutionary algorithm to analyze the fitness landscape of the genetic code adaptability
    Santos, Jose
    Monteagudo, Angel
    BMC BIOINFORMATICS, 2017, 18
  • [22] Inclusion of the fitness sharing technique in an evolutionary algorithm to analyze the fitness landscape of the genetic code adaptability
    José Santos
    Ángel Monteagudo
    BMC Bioinformatics, 18
  • [23] Fitness landscape and evolutionary Boolean synthesis using information theory concepts
    Aguirre, AH
    Coello, CC
    2003 NASA/DOD CONFERENCE ON EVOLVABLE HARDWARE, 2003, : 13 - 16
  • [24] Thermodynamical interpretation of evolutionary dynamics on a fitness landscape in an evolution reactor, II
    Takuyo Aita
    Shunichi Morinaga
    Yuzuru Husimi
    Bulletin of Mathematical Biology, 2005, 67 : 613 - 635
  • [25] Thermodynamical interpretation of evolutionary dynamics on a fitness landscape in a evolution reactor, I
    Takuyo Aita
    Shunichi Morinaga
    Yuzuru Husimi
    Bulletin of Mathematical Biology, 2004, 66 : 1371 - 1403
  • [26] Thermodynamical interpretation of evolutionary dynamics on a fitness landscape in a evolution reactor, I
    Aita, T
    Morinaga, S
    Husimi, Y
    BULLETIN OF MATHEMATICAL BIOLOGY, 2004, 66 (05) : 1371 - 1403
  • [27] Thermodynamical interpretation of evolutionary dynamics on a fitness landscape in an evolution reactor, II
    Aita, T
    Morinaga, S
    Husimi, Y
    BULLETIN OF MATHEMATICAL BIOLOGY, 2005, 67 (03) : 613 - 635
  • [28] Experimental Rugged Fitness Landscape in Protein Sequence Space
    Hayashi, Yuuki
    Aita, Takuyo
    Toyota, Hitoshi
    Husimi, Yuzuru
    Urabe, Itaru
    Yomo, Tetsuya
    PLOS ONE, 2006, 1 (01):
  • [29] Experimental Analysis of the Relevance of Fitness Landscape Topographical Characterization
    Caamano, Pilar
    Bellas, Francisco
    Becerra, Jose A.
    Diaz, Vicente
    Duro, Richard J.
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [30] Dynamic selection of evolutionary operators based on online learning and fitness landscape analysis
    Pietro A. Consoli
    Yi Mei
    Leandro L. Minku
    Xin Yao
    Soft Computing, 2016, 20 : 3889 - 3914