13 papers · ranked by Valyu relevance
André L. L. Moreira, César Rennó-Costa
Evolution optimizes cellular behavior throughout sequential generations by selecting the successful individual cells in a given context. As gene regulatory networks (GRNs) determine the behavior of single cells by ruling the activation of different processes - such as cell differentiation and death - how GRNs change…
Edith Invernizzi, Graeme D Ruxton
The metaphor of fitness landscapes is common in evolutionary biology, as a way to visualise the change in allele or phenotypic frequencies of a population under selection. Understanding how different factors in the evolutionary process affect the trajectory of the population across the landscape is of interest to both…
Stefano Nolfi, Paolo Pagliuca
We investigate the use of competitive co-evolution for synthesizing progressively better solutions. Specifically, we introduce a set of methods to measure historical and global progress. We discuss the factors that facilitate genuine progress. Finally, we compare the efficacy of four qualitatively different algorithms.…
Dogan Corus, Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre
Understanding how the time-complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evolutionary computation. Most rigorous results were derived using a handful of key analytic techniques, including drift analysis. However…
Martín Gutiérrez, Yerko Ortiz, Javier Carrión
Metaheuristic procedures (MH) have been a trend driving Artificial Intelligence (AI) researchers for the past 50 years. A variety of tools and applications (not only in Computer Science) stem from these techniques. Also, MH frequently rely on evolution, a trademark process involved in cell colony growth. Generally, MH…
Nono S. C. Merleau, Matteo Smerlak
A Lévy flight is a random walk with step sizes that follow a heavy-tailed probability distribution. This type of random walk, with many small steps and a few large ones, has inspired many applications in genetic programming and evolutionary algorithms in recent years, but is yet to be applied to RNA design. Here we…
Lillian T. Tatka, Lucian P. Smith, Herbert M. Sauro
Evolutionary algorithms, a class of optimization techniques inspired by biological evolution, have emerged as powerful tools for the optimization of complex systems, including the evolution of mass-action chemical reaction networks. This work explores the application of evolutionary algorithms in this domain…
Prasad U. Bandodkar, Razeen R. Shaikh, Gregory T. Reeves
Model development is essential to gain a mathematical understanding of the underlying phenomena in systems biology. In most models, it is typically hard to estimate the values of the biophysical/phenomenological parameters that characterize the model. The parameters are estimated by minimizing a function that reduces a…
Alexander Lalejini, Emily Dolson, Anya E. Vostinar, Luis Zaman
Directed microbial evolution harnesses evolutionary processes in the laboratory to construct microorganisms with enhanced or novel functional traits. Attempting to direct evolutionary processes for applied goals is fundamental to evolutionary computation, which harnesses the principles of Darwinian evolution as a…
Artem Kaznatcheev
Valiant [1] proposed to treat Darwinian evolution as a special kind of computational learning from statistical queries. The statistical queries represent a genotype’s fitness over a distribution of challenges. And this distribution of challenges along with the best response to them specify a given abiotic environment…
Ulises Sánchez Iñiguez, Sara Lledó Villaescusa, Rafael Lahoz-Beltra
Synthetic biology applications are currently based on the programming of bacteria with tailor-made circuits designed ad hoc by applying a top-down strategy. We introduce a novel algorithm oriented to design synthetic bacteria according to a bottom-up approach, i.e. via an ‘evolutionary programming’ algorithm. The…
Ashley I. Teufel, Claus O. Wilke
We present an accelerated algorithm to forward-simulate origin--fixation models. Our algorithm requires on average only about two fitness evaluations per fixed mutation, whereas traditional algorithms require, per one fixed mutation, a number of fitness evaluations on the order of the effective population size Ne. Our…
Oliver Attie, Brian Sulkow, Chong Di, Wei-Gang Qiu
Learning algorithms have been proposed as a non-selective mechanism capable of creating complex adaptive systems in life. Evolutionary learning however has not been demonstrated to be a plausible cause for the origin of a specific molecular system. Here we show that genetic codes as optimal as the Standard Genetic Code…