Related papers: A Simple Haploid-Diploid Evolutionary Algorithm
The time evolution of a simple model for crossover is discussed. A variant of this model with an improved exploration behavior in phase space is derived as a subset of standard one- and multi-point crossover operations. This model is solved…
Learning ensembles by bagging can substantially improve the generalization performance of low-bias, high-variance estimators, including those evolved by Genetic Programming (GP). To be efficient, modern GP algorithms for evolving (bagging)…
We study in detail a recently proposed simple discrete model for evolution on smooth landscapes. An asymptotic solution of this model for long times is constructed. We find that the dynamics of the population are governed by correlation…
Proteins evolve through complex sequence spaces, with fitness landscapes serving as a conceptual framework that links sequence to function. Fitness landscapes can be smooth, where multiple similarly accessible evolutionary paths are…
We propose a minimal model to simulate long waiting times followed by evolutionary bursts on rugged landscapes. It combines point and inversions-like mutations as sources of genetic variation. The inversions are intended to simulate one of…
The preferred conditions for evolutionary innovation is a fundamental question, but little is known, in part because the question involves rare events. We focused on the potential role of polyploidy in the evolution of novel traits. There…
We propose a class of evolutionary models that involves an arbitrary exchangeable process as the breeding process and different selection schemes. In those models, a new genome is born according to the breeding process, and then a genome is…
We modify the Penna Model for biological aging, which is based on the mutation-accumulation theory, in order to verify if there would be any evolutionary advantage of triploid over diploid organisms. We show that this is not the case, and…
Evolution and learning are two of the fundamental mechanisms by which life adapts in order to survive and to transcend limitations. These biological phenomena inspired successful computational methods such as evolutionary algorithms and…
Nature features a plethora of extraordinary photonic architectures that have been optimized through natural evolution. While numerical optimization is increasingly and successfully used in photonics, it has yet to replicate any of these…
Computer experiments that mirror the evolutionary dynamics of sexual and asexual organisms as they occur in nature, tested features proposed to explain the evolution of sexual recombination. Results show that this evolution is better…
This paper develops simplified mathematical models describing the mutation-selection balance for the asexual and sexual replication pathways in {\it Saccharomyces cerevisiae}. We assume diploid genomes consisting of two chromosomes, and we…
This paper studies the mutation-selection balance in three simplified replication models. The first model considers a population of organisms replicating via the production of asexual spores. The second model considers a sexually…
The concept of fitness is introduced, and a simple derivation of the Fundamental Theorem of Natural Selection (which states that the average fitness of a population increases if its variance is nonzero) is given. After a short discussion of…
This work presents a population genetic model of evolution, which includes haploid selection, mutation, recombination, and drift. The mutation-selection equilibrium can be expressed exactly in closed form for arbitrary fitness functions…
The development of a large non-coding fraction in eukaryotic DNA and the phenomenon of the code-bloat in the field of evolutionary computations show a striking similarity. This seems to suggest that (in the presence of mechanisms of code…
This paper demonstrates that simple yet important characteristics of coevolution can occur in evolutionary algorithms when only a few conditions are met. We find that interaction-based fitness measurements such as fitness (linear) ranking…
The $NK$ model, introduced by Kauffman, Levin, and Weinberger, is a random field used to describe the fitness landscape of certain species with $N$ genetic loci, each interacting with $K$ others. The model has wide applications in…
In this work we study a simple evolutionary model of bipartite networks which its evolution is based on the duplication of nodes. Using analytical results along with numerical simulation of the model, we show that the above evolutionary…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…