Chemical Genetic Programming -Coevolution Between Genotypic Strings and Phenotypic Trees

Abstract. Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings to phenotypic trees. Chemical Genetic Programming (CGP) An initial set of rewriting rules is supplied that provides the system with the syntactical structure within which all programs must be generated. These rules allow only executable programs to be generated, but do not place any artificial limitations on the complexity or structure of these programs. Individuals are initially randomly generated, then evolved to form the population of successive generations. The fitness value of an individual is calculated using a correlation function that compares the target function with the individual's generated function. Based on their fitness values, cells, including both the DNA and the rewriting rules, are selected and then evolved. Evolution consists of mutation of DNA units, single point DNA crossover and molecular exchange between two cells, and selection of cells. Evolution adaptively changes not only the DNA information, but also the rewriting rules in cells. This enables the evolutionary optimization of the genotype (DNA) to phenotype (tree) mapping, by which we expect CGP to find the best translation grammar for creating a solution from the one-dimensional genotypic information. To examine the effectiveness of CGP, it was applied to a selected symbolic regression problem, and the results were compared against those of Grammatical Evolution (GE

An Empirical Study of Graph Grammar Evolution

Vukovar, Croati

The evolution of diversity in the structure and function of artificial organisms

Life on Earth has been shaped by evolutionary processes into a marvelous diversity of form and function, at all levels from melecules to ecosystems. It can be expected that no single conceptual framework ca encompass all the aspects of the evolution of diversity. This thesis explores this question from three different points of view: the role of developmental processes, the role of evolutionary dynamics, and the interplay between the body's control system

A Field Guide to Genetic Programming

xiv, 233 p. : il. ; 23 cm.Libro ElectrónicoA Field Guide to Genetic Programming (ISBN 978-1-4092-0073-4) is an introduction to genetic programming (GP). GP is a systematic, domain-independent method for getting computers to solve problems automatically starting from a high-level statement of what needs to be done. Using ideas from natural evolution, GP starts from an ooze of random computer programs, and progressively refines them through processes of mutation and sexual recombination, until solutions emerge. All this without the user having to know or specify the form or structure of solutions in advance. GP has generated a plethora of human-competitive results and applications, including novel scientific discoveries and patentable inventions. The authorsIntroduction -- Representation, initialisation and operators in Tree-based GP -- Getting ready to run genetic programming -- Example genetic programming run -- Alternative initialisations and operators in Tree-based GP -- Modular, grammatical and developmental Tree-based GP -- Linear and graph genetic programming -- Probalistic genetic programming -- Multi-objective genetic programming -- Fast and distributed genetic programming -- GP theory and its applications -- Applications -- Troubleshooting GP -- Conclusions.Contents xi 1 Introduction 1.1 Genetic Programming in a Nutshell 1.2 Getting Started 1.3 Prerequisites 1.4 Overview of this Field Guide I Basics 2 Representation, Initialisation and GP 2.1 Representation 2.2 Initialising the Population 2.3 Selection 2.4 Recombination and Mutation Operators in Tree-based 3 Getting Ready to Run Genetic Programming 19 3.1 Step 1: Terminal Set 19 3.2 Step 2: Function Set 20 3.2.1 Closure 21 3.2.2 Sufficiency 23 3.2.3 Evolving Structures other than Programs 23 3.3 Step 3: Fitness Function 24 3.4 Step 4: GP Parameters 26 3.5 Step 5: Termination and solution designation 27 4 Example Genetic Programming Run 4.1 Preparatory Steps 29 4.2 Step-by-Step Sample Run 31 4.2.1 Initialisation 31 4.2.2 Fitness Evaluation Selection, Crossover and Mutation Termination and Solution Designation Advanced Genetic Programming 5 Alternative Initialisations and Operators in 5.1 Constructing the Initial Population 5.1.1 Uniform Initialisation 5.1.2 Initialisation may Affect Bloat 5.1.3 Seeding 5.2 GP Mutation 5.2.1 Is Mutation Necessary? 5.2.2 Mutation Cookbook 5.3 GP Crossover 5.4 Other Techniques 32 5.5 Tree-based GP 39 6 Modular, Grammatical and Developmental Tree-based GP 47 6.1 Evolving Modular and Hierarchical Structures 47 6.1.1 Automatically Defined Functions 48 6.1.2 Program Architecture and Architecture-Altering 50 6.2 Constraining Structures 51 6.2.1 Enforcing Particular Structures 52 6.2.2 Strongly Typed GP 52 6.2.3 Grammar-based Constraints 53 6.2.4 Constraints and Bias 55 6.3 Developmental Genetic Programming 57 6.4 Strongly Typed Autoconstructive GP with PushGP 59 7 Linear and Graph Genetic Programming 61 7.1 Linear Genetic Programming 61 7.1.1 Motivations 61 7.1.2 Linear GP Representations 62 7.1.3 Linear GP Operators 64 7.2 Graph-Based Genetic Programming 65 7.2.1 Parallel Distributed GP (PDGP) 65 7.2.2 PADO 67 7.2.3 Cartesian GP 67 7.2.4 Evolving Parallel Programs using Indirect Encodings 68 8 Probabilistic Genetic Programming 8.1 Estimation of Distribution Algorithms 69 8.2 Pure EDA GP 71 8.3 Mixing Grammars and Probabilities 74 9 Multi-objective Genetic Programming 75 9.1 Combining Multiple Objectives into a Scalar Fitness Function 75 9.2 Keeping the Objectives Separate 76 9.2.1 Multi-objective Bloat and Complexity Control 77 9.2.2 Other Objectives 78 9.2.3 Non-Pareto Criteria 80 9.3 Multiple Objectives via Dynamic and Staged Fitness Functions 80 9.4 Multi-objective Optimisation via Operator Bias 81 10 Fast and Distributed Genetic Programming 83 10.1 Reducing Fitness Evaluations/Increasing their Effectiveness 83 10.2 Reducing Cost of Fitness with Caches 86 10.3 Parallel and Distributed GP are Not Equivalent 88 10.4 Running GP on Parallel Hardware 89 10.4.1 Master–slave GP 89 10.4.2 GP Running on GPUs 90 10.4.3 GP on FPGAs 92 10.4.4 Sub-machine-code GP 93 10.5 Geographically Distributed GP 93 11 GP Theory and its Applications 97 11.1 Mathematical Models 98 11.2 Search Spaces 99 11.3 Bloat 101 11.3.1 Bloat in Theory 101 11.3.2 Bloat Control in Practice 104 III Practical Genetic Programming 12 Applications 12.1 Where GP has Done Well 12.2 Curve Fitting, Data Modelling and Symbolic Regression 12.3 Human Competitive Results – the Humies 12.4 Image and Signal Processing 12.5 Financial Trading, Time Series, and Economic Modelling 12.6 Industrial Process Control 12.7 Medicine, Biology and Bioinformatics 12.8 GP to Create Searchers and Solvers – Hyper-heuristics xiii 12.9 Entertainment and Computer Games 127 12.10The Arts 127 12.11Compression 128 13 Troubleshooting GP 13.1 Is there a Bug in the Code? 13.2 Can you Trust your Results? 13.3 There are No Silver Bullets 13.4 Small Changes can have Big Effects 13.5 Big Changes can have No Effect 13.6 Study your Populations 13.7 Encourage Diversity 13.8 Embrace Approximation 13.9 Control Bloat 13.10 Checkpoint Results 13.11 Report Well 13.12 Convince your Customers 14 Conclusions Tricks of the Trade A Resources A.1 Key Books A.2 Key Journals A.3 Key International Meetings A.4 GP Implementations A.5 On-Line Resources 145 B TinyGP 151 B.1 Overview of TinyGP 151 B.2 Input Data Files for TinyGP 153 B.3 Source Code 154 B.4 Compiling and Running TinyGP 162 Bibliography 167 Inde

Biological evolution through mutation, selection, and drift: An introductory review

Motivated by present activities in (statistical) physics directed towards biological evolution, we review the interplay of three evolutionary forces: mutation, selection, and genetic drift. The review addresses itself to physicists and intends to bridge the gap between the biological and the physical literature. We first clarify the terminology and recapitulate the basic models of population genetics, which describe the evolution of the composition of a population under the joint action of the various evolutionary forces. Building on these foundations, we specify the ingredients explicitly, namely, the various mutation models and fitness landscapes. We then review recent developments concerning models of mutational degradation. These predict upper limits for the mutation rate above which mutation can no longer be controlled by selection, the most important phenomena being error thresholds, Muller's ratchet, and mutational meltdowns. Error thresholds are deterministic phenomena, whereas Muller's ratchet requires the stochastic component brought about by finite population size. Mutational meltdowns additionally rely on an explicit model of population dynamics, and describe the extinction of populations. Special emphasis is put on the mutual relationship between these phenomena. Finally, a few connections with the process of molecular evolution are established.Comment: 62 pages, 6 figures, many reference

Speciation in Digital Organisms

Current estimates of the number of species on Earth range from four to forty million total species. Why are there so many species? The answer must include both ecology and evolution. Ecology looks at the interactions between coexisting species, while evolution tracks them through time. Both are required to understand aspects of environments which promote speciation, and which promote species persistence in time. The explanation for this biodiversity is still not well understood. I argue that resource limitations are a major factor in the evolutionary origin of complex ecosystems with interacting and persistent species. Through experiments with digital organisms in environment with multiple limited resources, I show that these conditions alone can be sufficient to induce differentiation in a population. Moreover, the observed pattern of species number distributions match patterns observed in nature. I develop a simple metric for phenotypic distance for digital organisms, which permits quantitative analysis of similarities within, and differences between species. This enables a clear species concept for digital organisms that may also be applied to biological organisms, thus helping to clarify the biological species concept. Finally, I will use this measurement methodology to predict species and ecosystem stability.</p

A phylogenetic method to perform genome-wide association studies in microbes

Genome-Wide Association Studies (GWAS) are designed to perform an unbiased search of genetic sequence data with the intent of identifying statistically significant associations with a phenotype or trait of interest. The application of GWAS methods to microbial organisms promises to improve the way we understand, manage, and treat infectious diseases. Yet, while microbial pathogens continue to undermine human health, wealth, and longevity, microbial GWAS methods remain unable to fully capitalise on the growing wealth of bacterial and viral genetic sequence data. Clonal population structure and homologous recombination in microbial organisms make it difficult for existing GWAS methods to achieve both the precision needed to reject false positive findings and the statistical power required to detect genuine associations between microbial genotypic and phenotypic variants. In this thesis, we investigate potential solutions to the most substantial methodological challenges in microbial GWAS, and we introduce a new phylogenetic GWAS approach that has been specifically designed for use in bacterial samples. In presenting our approach, we describe the features that render it robust to the confounding effects of both population structure and recombination, while maintaining high statistical power to detect associations. Our approach is applicable to organisms ranging from purely clonal to frequently recombining, to sequence data from both the core and accessory genome, and to binary, categorical, and continuous phenotypes. We also describe the efforts taken to make our method efficient, scalable, and accessible in its implementation within the open-source R package we have created, called treeWAS. Next, we apply our GWAS method to simulated datasets. We develop multiple frameworks for simulating genotypic and phenotypic data with control over relevant parameters. We then present the results of our simulation study, and we use thorough performance testing to demonstrate the power and specificity of our approach, as compared to the performance of alternative cluster-based and dimension-reduction methods. Our approach is then applied to three empirical datasets, from Neisseria gonorrhoeae and Neisseria meningitidis, where we identify core SNPs associated with binary drug resistance and continuous antibiotic minimum inhibitory concentration phenotypes, as well as both core SNP and accessory genome associations with invasive and commensal phenotypes. These applications illustrate the versatility and potential of our method, demonstrating in each case that our approach is capable of confirming known resistance- or virulence-associated loci and discovering novel associations. Our thesis concludes with a review of the previous chapters and an evaluation of the strengths and limitations displayed by the current implementation of our phylogenetic approach to association testing. We discuss key areas for further development, and we propose potential solutions to advance the development of microbial GWAS in future work.Open Acces

Complexity, Language, and Life: Mathematical Approaches

In May 1984 the Swedish Council for Scientific Research convened a small group of investigators at the scientific research station at Abisko, Sweden, for the purpose of examining various conceptual and mathematical views of the evolution of complex systems. The stated theme of the meeting was deliberately kept vague, with only the purpose of discussing alternative mathematically based approaches to the modeling of evolving processes being given as a guideline to the participants. In order to limit the scope to some degree, it was decided to emphasize living rather than nonliving processes and to invite participants from a range of disciplinary specialities spanning the spectrum from pure and applied mathematics to geography and analytic philosophy. The results of the meeting were quite extraordinary; while there was no intent to focus the papers and discussion into predefined channels, an immediate self-organizing effect took place and the deliberations quickly oriented themselves into three main streams: conceptual and formal structures for characterizing system complexity; evolutionary processes in biology and ecology; the emergence of complexity through evolution in natural languages. The chapters presented in this volume are not the proceedings of the meeting. Following the meeting, the organizers felt that the ideas and spirit of the gathering should be preserved in some written form, so the participants were each requested to produce a chapter, explicating the views they presented at Abisko, written specifically for this volume. The results of this exercise are contained in this book

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp