| Literature DB >> 23226153 |
Alexander E Lobkovsky1, Eugene V Koonin.
Abstract
The question whether adaptation follows a deterministic route largely prescribed by the environment or can proceed along a large number of alternative trajectories has engaged extensive research over the recent years. Experimental evolution studies enabled by advances in high throughput techniques for genome sequencing and manipulation, along with increasingly detailed mathematical modeling of fitness landscapes, are beginning to allow quantitative exploration of the repeatability of evolutionary trajectories. It is becoming clear that evolutionary trajectories in static correlated fitness landscapes are substantially non-random but the relative contributions of determinism and stochasticity in the evolution of specific phenotypes strongly depend on the specific conditions, particularly the magnitude of the selective pressure and the number of available beneficial mutations.Entities:
Keywords: divergence of trajectories; evolutionary trajectory; fitness landscape; predictability of evolution
Year: 2012 PMID: 23226153 PMCID: PMC3509945 DOI: 10.3389/fgene.2012.00246
Source DB: PubMed Journal: Front Genet ISSN: 1664-8021 Impact factor: 4.599
Figure 1Mutation rate and evolutionary trajectories on fitness landscapes. When mutations are rare (A), the population is nearly homogeneous and mutations are fixed sequentially via sweeps. Evolution can therefore be represented by a single path on the fitness landscape. Several distinct clones coexist at any given time in the population when mutation rate is high. (B) If each clone is allotted its own trajectory, the evolution of the population can be represented by a bundle of trajectories which split and terminate on the way to the summit. At any given time the population can be represented by a probability density function in sequence space.
Figure 2Divergence of evolutionary paths on fitness landscapes. (A) Demonstrates monotonic paths on a fitness landscape. Each path’s probability of occurrence in the SSWM limit is the inverse product of the number of “up” steps at each point along the path. The ensemble path divergence of the “ensemble” consisting of only these two paths would be the product of their probabilities of occurrence and the inter-path distance. (B) Illustrates the calculation of the inter-path distance d(p1, p2). For every point x1 ∈ p1 we find the closest point on p2 and record the distance d(x1, p2). We perform the same operation for points on p2. The distance is then d(p1, p2) = (∑d(x1, p2) + ∑d(x2, p1))/(length(p1) + length(p2)).