Trotter Meredith V, Weissman Daniel B, Peterson Grant I, Peck Kayla M, Masel Joanna
Department of Biology, Stanford University, Stanford, California, 95306; Department of Ecology and Evolutionary Biology, University of Arizona, Tucson, Arizona, 85721.
Evolution. 2014 Dec;68(12):3357-67. doi: 10.1111/evo.12517. Epub 2014 Sep 29.
The existence of complex (multiple-step) genetic adaptations that are "irreducible" (i.e., all partial combinations are less fit than the original genotype) is one of the longest standing problems in evolutionary biology. In standard genetics parlance, these adaptations require the crossing of a wide adaptive valley of deleterious intermediate stages. Here, we demonstrate, using a simple model, that evolution can cross wide valleys to produce "irreducibly complex" adaptations by making use of previously cryptic mutations. When revealed by an evolutionary capacitor, previously cryptic mutants have higher initial frequencies than do new mutations, bringing them closer to a valley-crossing saddle in allele frequency space. Moreover, simple combinatorics implies an enormous number of candidate combinations exist within available cryptic genetic variation. We model the dynamics of crossing of a wide adaptive valley after a capacitance event using both numerical simulations and analytical approximations. Although individual valley crossing events become less likely as valleys widen, by taking the combinatorics of genotype space into account, we see that revealing cryptic variation can cause the frequent evolution of complex adaptations.
复杂(多步骤)遗传适应的存在,即“不可简化的”(也就是说,所有部分组合的适应性都低于原始基因型),是进化生物学中存在时间最长的问题之一。用标准遗传学的说法,这些适应需要跨越有害中间阶段构成的宽广适应谷。在此,我们通过一个简单模型证明,进化可以利用先前隐藏的突变跨越宽广的山谷,从而产生“不可简化的复杂”适应。当被一个进化电容器揭示时,先前隐藏的突变体比新突变具有更高的初始频率,使它们在等位基因频率空间中更接近跨越山谷的鞍点。此外,简单的组合数学表明,在可用的隐藏遗传变异中存在大量的候选组合。我们使用数值模拟和解析近似方法,对电容事件后跨越宽广适应谷的动态过程进行了建模。尽管随着山谷变宽,单个跨越山谷的事件发生的可能性降低,但考虑到基因型空间的组合数学,我们发现揭示隐藏变异会导致复杂适应的频繁进化。