首页> 外文期刊>Journal of Mathematical Biology >Adaptive walks by the fittest among finite random mutants on a Mt. Fuji-type fitness landscape - II. Effect of small non-additivity
【24h】

Adaptive walks by the fittest among finite random mutants on a Mt. Fuji-type fitness landscape - II. Effect of small non-additivity

机译:适应性行走在山上的有限随机突变体之间的最适度。富士式健身景观-二。小不加性的影响

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

摘要

We examined properties of adaptive walks by the fittest on "rough Mt. Fuji-type" fitness landscapes, which are modeled by superposing small uncorrelated random component on an additive fitness landscape. A single adaptive walk is carried out by repetition of the evolution cycle composed of (1) mutagenesis process that produces random d-fold point mutants of population size N and (2) selection process that picks out the fittest mutant among them. To comprehend trajectories of the walkers, the fitness landscape is mapped into a (x, y, z)-space, where x, y and z represent, respectively, normalized Hamming distance from the peak on the additive fitness landscape, scaled additive fitness and scaled non-additive fitness. Thus a single adaptive walk is expressed as the dynamics of a particle in this space. We drew the "hill-climbing" vector field, where each vector represents the most probable step for a walker in a single step. Almost all of the walkers are expected to move along streams of vectors existing on a particular surface that overlies the (x, y)-plane, toward the neighborhood of a characteristic point at which a mutation-selection-random drift balance is reached. We could theoretically predict this reachable point in the case of random sampling search strategy. [References: 26]
机译:我们通过在“粗糙的富士山型”健身景观上进行了最适度的测试,研究了适应性步行的属性,该模型通过将小的不相关的随机分量叠加在加法健身景观上来建模。通过重复由(1)诱变过程组成的进化循环来进行单个适应性行走,该诱变过程产生种群大小为N的随机d折叠点突变体,(2)选择其中最适合的突变体的选择过程。为了理解步行者的轨迹,将健身景观映射到(x,y,z)空间,其中x,y和z分别表示从加性健身景观中的峰到顶点的标准化汉明距离,成比例的加性健身和扩展的非加性适应度。因此,单个自适应游动表示为该空间中粒子的动力学。我们绘制了“爬坡”矢量场,其中每个矢量代表单个步骤中步行者最可能的步骤。预期几乎所有的步行者都将沿着存在于(x,y)平面上的特定表面上的矢量流向达到突变选择随机漂移平衡的特征点附近移动。在随机抽样搜索策略的情况下,我们可以从理论上预测此可达点。 [参考:26]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号