If mutations arose in nongrowing cells, as proposed in Foster’s paper (1), then stress-induced mutagenesis would seem inescapable. The plated population certainly grows very little. However, no evidence is provided that reversion occurs in this population and no effort is made to counter evidence to the contrary (see below)—that mutations actually arise in cells growing under selection within d...

Adaptive evolutionary algorithms require a more sophisticated modeling than their static-parameter counterparts. Taking into account the current population is not enough when implementing parameter-adaptation rules based on success rates (evolution strategies) or on premature convergence (genetic algorithms). Instead of Markov chains, we use random systems with complete connections - accounting...

Reversion of an episomal Lac- allele during lactose selection has been studied as a model for adaptive mutation. Although recent results show that the mutations that arise during selection are not "adaptive" in the original sense, the mutagenic mechanism that produces these mutations may nonetheless be of evolutionary significance. In addition, a transient mutational state induced in a subpopul...

This study is focused on an evolutionary algorithm for automated de novo drug design. It discusses how to improve the mutation operator of such an algorithm. By introducing a weighted mutation scheme it tries to improve the performance of the algorithm as well as facilitating for the use of self-adaptation. The two questions which this study tries to answer are: Does introduction of di erent we...

The Dynamic Search Fireworks Algorithm (dynFWA) is an effective algorithm for solving optimization problems. However, dynFWA easily falls into local optimal solutions prematurely and it also has a slow convergence rate. In order to improve these problems, an adaptive mutation dynamic search fireworks algorithm (AMdynFWA) is introduced in this paper. The proposed algorithm applies the Gaussian m...

The Rosenberg-Hastings paper (4) defends a model much like that of Foster (1) and argues that the observed mutagenesis contradicts predictions of the amplification model. On the contrary, amplification indirectly causes weak mutagenesis and allows that mutagenesis to have a detectable effect on lac reversion. However, this mutagenesis is a minor side effect that is neither sufficient nor necess...

This paper studies the problem of scheduling N jobs in a hybrid flowshop with unrelated parallel machines at each stage. Considering practical application presented problem, no-wait constraints and objective function total flowtime are included problem. A mathematical model is constructed novel genetic simulated annealing algorithm so-called GSAA developed to solve this In algorithm, firstly mo...

For evolving populations of replicators, there is much evidence that the effect of mutations on fitness depends on the degree of adaptation to the selective pressures at play. In optimized populations, most mutations have deleterious effects, such that low mutation rates are favoured. In contrast to this, in populations thriving in changing environments a larger fraction of mutations have benef...

High-throughput sequencing has enabled genetic screens that can rapidly identify mutations that occur during experimental evolution. The presence of a mutation in an evolved lineage does not, however, constitute proof that the mutation is adaptive, given the well-known and widespread phenomenon of genetic hitchhiking, in which a non-adaptive or even detrimental mutation can co-occur in a genome...

A method of self-adaptive mutation, crossover and selection was implemented and applied in four genetic algorithms. So developed self-adapting algorithms were then compared, with respect to convergence, with a traditional genetic one, which contained constant rates of mutation and crossover. The experiments were conducted on six benchmark functions including two unimodal functions, three multim...