25 research outputs found

    Exact Results for Amplitude Spectra of Fitness Landscapes

    Full text link
    Starting from fitness correlation functions, we calculate exact expressions for the amplitude spectra of fitness landscapes as defined by P.F. Stadler [J. Math. Chem. 20, 1 (1996)] for common landscape models, including Kauffman's NK-model, rough Mount Fuji landscapes and general linear superpositions of such landscapes. We further show that correlations decaying exponentially with the Hamming distance yield exponentially decaying spectra similar to those reported recently for a model of molecular signal transduction. Finally, we compare our results for the model systems to the spectra of various experimentally measured fitness landscapes. We claim that our analytical results should be helpful when trying to interpret empirical data and guide the search for improved fitness landscape models.Comment: 13 pages, 5 figures; revised and final versio

    Adaptation in tunably rugged fitness landscapes: The Rough Mount Fuji Model

    Full text link
    Much of the current theory of adaptation is based on Gillespie's mutational landscape model (MLM), which assumes that the fitness values of genotypes linked by single mutational steps are independent random variables. On the other hand, a growing body of empirical evidence shows that real fitness landscapes, while possessing a considerable amount of ruggedness, are smoother than predicted by the MLM. In the present article we propose and analyse a simple fitness landscape model with tunable ruggedness based on the Rough Mount Fuji (RMF) model originally introduced by Aita et al. [Biopolymers 54:64-79 (2000)] in the context of protein evolution. We provide a comprehensive collection of results pertaining to the topographical structure of RMF landscapes, including explicit formulae for the expected number of local fitness maxima, the location of the global peak, and the fitness correlation function. The statistics of single and multiple adaptive steps on the RMF landscape are explored mainly through simulations, and the results are compared to the known behavior in the MLM model. Finally, we show that the RMF model can explain the large number of second-step mutations observed on a highly-fit first step backgound in a recent evolution experiment with a microvirid bacteriophage [Miller et al., Genetics 187:185-202 (2011)].Comment: 43 pages, 12 figures; revised version with new results on the number of fitness maxim

    Fitness Landscapes, Adaptation and Sex on the Hypercube

    Get PDF
    The focus of this thesis is on the theoretical treatment of fitness landscapes in the context of evolutionary processes. Fitness landscapes connect an organism’s genome to its fitness. They are an important tool of theoretical evolutionary biology and in the recent years also experimental results became available. In this thesis, several models of fitness landscapes are analyzed with different analytical and numerical methods. The goal is to identify characteristics in order to compare the model landscapes to experimental measurements. Furthermore, different adaptive processes are examined. On the one hand such which run with mutations under selection, especially adaptive walks. On the other hand such which include recombination. Since these are non-linear in time development, an analytical approach is hindered which leads to an increasing use of computer simulations

    Fundamental Properties of the Evolution of Mutational Robustness

    Full text link
    Evolution on neutral networks of genotypes has been found in models to concentrate on genotypes with high mutational robustness, to a degree determined by the topology of the network. Here analysis is generalized beyond neutral networks to arbitrary selection and parent-offspring transmission. In this larger realm, geometric features determine mutational robustness: the alignment of fitness with the orthogonalized eigenvectors of the mutation matrix weighted by their eigenvalues. "House of cards" mutation is found to preclude the evolution of mutational robustness. Genetic load is shown to increase with increasing mutation in arbitrary single and multiple locus fitness landscapes. The rate of decrease in population fitness can never grow as mutation rates get higher, showing that "error catastrophes" for genotype frequencies never cause precipitous losses of population fitness. The "inclusive inheritance" approach taken here naturally extends these results to a new concept of dispersal robustness.Comment: 17 pages, 1 figur

    Evolutionary accessibility of modular fitness landscapes

    Full text link
    A fitness landscape is a mapping from the space of genetic sequences, which is modeled here as a binary hypercube of dimension LL, to the real numbers. We consider random models of fitness landscapes, where fitness values are assigned according to some probabilistic rule, and study the statistical properties of pathways to the global fitness maximum along which fitness increases monotonically. Such paths are important for evolution because they are the only ones that are accessible to an adapting population when mutations occur at a low rate. The focus of this work is on the block model introduced by A.S. Perelson and C.A. Macken [Proc. Natl. Acad. Sci. USA 92:9657 (1995)] where the genome is decomposed into disjoint sets of loci (`modules') that contribute independently to fitness, and fitness values within blocks are assigned at random. We show that the number of accessible paths can be written as a product of the path numbers within the blocks, which provides a detailed analytic description of the path statistics. The block model can be viewed as a special case of Kauffman's NK-model, and we compare the analytic results to simulations of the NK-model with different genetic architectures. We find that the mean number of accessible paths in the different versions of the model are quite similar, but the distribution of the path number is qualitatively different in the block model due to its multiplicative structure. A similar statement applies to the number of local fitness maxima in the NK-models, which has been studied extensively in previous works. The overall evolutionary accessibility of the landscape, as quantified by the probability to find at least one accessible path to the global maximum, is dramatically lowered by the modular structure.Comment: 26 pages, 12 figures; final version with some typos correcte

    Greedy adaptive walks on a correlated fitness landscape

    Full text link
    We study adaptation of a haploid asexual population on a fitness landscape defined over binary genotype sequences of length LL. We consider greedy adaptive walks in which the population moves to the fittest among all single mutant neighbors of the current genotype until a local fitness maximum is reached. The landscape is of the rough mount Fuji type, which means that the fitness value assigned to a sequence is the sum of a random and a deterministic component. The random components are independent and identically distributed random variables, and the deterministic component varies linearly with the distance to a reference sequence. The deterministic fitness gradient cc is a parameter that interpolates between the limits of an uncorrelated random landscape (c=0c = 0) and an effectively additive landscape (cc \to \infty). When the random fitness component is chosen from the Gumbel distribution, explicit expressions for the distribution of the number of steps taken by the greedy walk are obtained, and it is shown that the walk length varies non-monotonically with the strength of the fitness gradient when the starting point is sufficiently close to the reference sequence. Asymptotic results for general distributions of the random fitness component are obtained using extreme value theory, and it is found that the walk length attains a non-trivial limit for LL \to \infty, different from its values for c=0c=0 and c=c = \infty, if cc is scaled with LL in an appropriate combination.Comment: minor change

    Multidimensional epistasis and the transitory advantage of sex

    Full text link
    Identifying and quantifying the benefits of sex and recombination is a long standing problem in evolutionary theory. In particular, contradictory claims have been made about the existence of a benefit of recombination on high dimensional fitness landscapes in the presence of sign epistasis. Here we present a comparative numerical study of sexual and asexual evolutionary dynamics of haploids on tunably rugged model landscapes under strong selection, paying special attention to the temporal development of the evolutionary advantage of recombination and the link between population diversity and the rate of adaptation. We show that the adaptive advantage of recombination on static rugged landscapes is strictly transitory. At early times, an advantage of recombination arises through the possibility to combine individually occurring beneficial mutations, but this effect is reversed at longer times by the much more efficient trapping of recombining populations at local fitness peaks. These findings are explained by means of well established results for a setup with only two loci. In accordance with the Red Queen hypothesis the transitory advantage can be prolonged indefinitely in fluctuating environments, and it is maximal when the environment fluctuates on the same time scale on which trapping at local optima typically occurs.Comment: 34 pages, 9 figures and 8 supplementary figures; revised and final versio

    Graph Laplacians, Nodal Domains, and Hyperplane Arrangements

    Get PDF
    Eigenvectors of the Laplacian of a graph G have received increasing attention in the recent past. Here we investigate their so-called nodal domains, i.e. the connected components of the maximal induced subgraphs of G on which an eigenvector ψ does not change sign. An analogue of Courant's nodal domain theorem provides upper bounds on the number of nodal domains depending on the location of ψ in the spectrum. This bound, however, is not sharp in general. In this contribution we consider the problem of computing minimal and maximal numbers of nodal domains for a particular graph. The class of Boolean Hypercubes is discussed in detail. We find that, despite the simplicity of this graph class, for which complete spectral information is available, the computations are still non-trivial. Nevertheless, we obtained some new results and a number of conjectures
    corecore