Quantifying Population Extinction and Examining the Effects of Different Mutation Rates Jason Stredwick Farshad Samimi Wei Huang Matt Luciw Matthew Rupp.

Slides:



Advertisements
Similar presentations
Natural Selection on Polygenic Traits
Advertisements

Natural Selection on Polygenic Traits
Bison Management Suppose you take over the management of a certain Bison population. The population dynamics are similar to those of the population we.
Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
Hypothesis testing Another judgment method of sampling data.
Chapter 4: Trees Part II - AVL Tree
Evolution of Populations
1 12. Principles of Parameter Estimation The purpose of this lecture is to illustrate the usefulness of the various concepts introduced and studied in.
Sample Size Power and other methods. Non-central Chisquare.
Variance reduction techniques. 2 Introduction Simulation models should be coded such that they are efficient. Efficiency in terms of programming ensures.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
1 CLG Handout Problem #1 (Examining interaction plots)
Bounds on Code Length Theorem: Let l ∗ 1, l ∗ 2,..., l ∗ m be optimal codeword lengths for a source distribution p and a D-ary alphabet, and let L ∗ be.
Sampling distributions of alleles under models of neutral evolution.
Majority and Minority games. Let G be a graph with all degrees odd. Each vertex is initially randomly assigned a colour (black or white), and at each.
Chapter 11 Contingency Table Analysis. Nonparametric Systems Another method of examining the relationship between independent (X) and dependant (Y) variables.
Chapter 11: Sequential Clinical Trials Descriptive Exploratory Experimental Describe Find Cause Populations Relationships and Effect Sequential Clinical.
Lecture 10 Comparison and Evaluation of Alternative System Designs.
Sampling and Participants
Reliability-Redundancy Allocation for Multi-State Series-Parallel Systems Zhigang Tian, Ming J. Zuo, and Hongzhong Huang IEEE Transactions on Reliability,
Marcus Gallagher and Mark Ledwich School of Information Technology and Electrical Engineering University of Queensland, Australia Sumaira Saeed Evolving.
Brandon Andrews.  What are genetic algorithms?  3 steps  Applications to Bioinformatics.
Warm-up- hand this in for credit
Integrating Neural Network and Genetic Algorithm to Solve Function Approximation Combined with Optimization Problem Term presentation for CSC7333 Machine.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Section 8.1 Estimating  When  is Known In this section, we develop techniques for estimating the population mean μ using sample data. We assume that.
16-2 Evolution as Genetic Change
« Performance of Compressed Inverted List Caching in Search Engines » Proceedings of the International World Wide Web Conference Commitee, Beijing 2008)
Bayesian Analysis and Applications of A Cure Rate Model.
Appendix B A BRIEF TOUR OF SOLVER Prescriptive Analytics
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
17.1 Genes and Variation.
17.2 Evolution as Genetic Change in Populations
Evolution in Genetic Terms
FORS 8450 Advanced Forest Planning Lecture 11 Tabu Search.
AP STATISTICS Section 5.1 Designing Samples. Objective: To be able to identify and use different sampling techniques. Observational Study: individuals.
Automated Patch Generation Adapted from Tevfik Bultan’s Lecture.
BCS547 Neural Decoding.
Linear Reduction Method for Tag SNPs Selection Jingwu He Alex Zelikovsky.
Efficient Space-Time Block Codes Designed by a Genetic Algorithm Don Torrieri U.S. Army Research Laboratory Matthew C. Valenti West Virginia University.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Occam’s Razor No Free Lunch Theorem Minimum.
SAMPLING DISTRIBUTION OF MEANS & PROPORTIONS. SAMPLING AND SAMPLING VARIATION Sample Knowledge of students No. of red blood cells in a person Length of.
SAMPLING DISTRIBUTION OF MEANS & PROPORTIONS. SAMPLING AND SAMPLING VARIATION Sample Knowledge of students No. of red blood cells in a person Length of.
Designing Studies In order to produce data that will truly answer the questions about a large group, the way a study is designed is important. 1)Decide.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Lesson Overview 17.2 Evolution as Genetic Change in Populations Insect populations often contain a few individuals that are resistant to a particular pesticide.
If we are all the same species (Homo sapien), why don’t we all look the same?
Random Change. In terms of genetics, it is any change in allele frequencies within a population. The H-W, provided conditions that evolution would not.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Genetic Algorithm (Knapsack Problem)
17.2 Evolution as Genetic Change in Populations
12. Principles of Parameter Estimation
Statistical Process Control
Evolution strategies and genetic programming
Sampling Distributions
Intro to microbial evolution
Evolution Random Change.
Empirical Studies of Evolvability in Tierra Preliminary Results
Natural Selection on Single Gene Traits
Sample vs Population comparing mean and standard deviations
17.2 Evolution as Genetic Change in Populations
17.2 Evolution as Genetic Change in Populations
Constraint Programming and Backtracking Search Algorithms
17.2 Evolution as Genetic Change in Populations
17.2 Evolution as Genetic Change in Populations
10/18/ B Samples and Surveys.
12. Principles of Parameter Estimation
Beyond Classical Search
Presentation transcript:

Quantifying Population Extinction and Examining the Effects of Different Mutation Rates Jason Stredwick Farshad Samimi Wei Huang Matt Luciw Matthew Rupp

Outline Project Overview and Goals Project Description –Baseline configuration –Experiment design Experiments / Discussion –Copy-point, cosmic-point, insertion and deletion mutation rates –Population size, genome length –Different mutation rates, extinction rates Conclusions

Project Overview Mutation rates past a certain point will almost always drive a population to extinction. The questions we posed were the following: –Will extinction always occur at some fixed minimum mutation rate or will it follow some type of probability gradient? –How do different types of mutation rates affect extinction? –What other parameters might affect when a population will go extinct? –For surviving populations, what are the effects of different mutation rates?

Project Setup: Baseline Configuration All mutation rates are zero 40 by 40 population size –Initially full of identical organisms Fixed genome length of 100 instructions Death is on –2000 instructions executed (reset when it gives birth) Local replacement birth method Different random number seeds for each run Experiments stopped after 30,000 updates 25 samples per data point, unless otherwise specified

Project Setup: Experiment Design To understand the affect of mutation rates on the probability of extinction, a simple mapping of the probability of extinction for each mutation rate type sampled. A mutation type, copy-point, was chosen to test the effects of the genome length and population size parameters on the probability of extinction. Three mutation rates were chosen to determine the effect of genome length and population size. –The effects were studied by varying both parameters independently vs P(e). To tie high mutation rates to commonly used mutation rates, a brief look at the evolution ability was sampled for a few common rates approaching the rates studied in this project. –Evolution ability was studied by looking at the number of tasks completed, and the fitness of the dominant organism.

Local replacement birth method problem Local replacement prefers empty cells over occupied cells Death timer is reset after every birth Effectively immortal A single organism was able to survive by only producing children (all broken) and never overwriting itself.

Cosmic-point Mutation Cosmic-point mutations means each site in the genome has a chance to mutate every update. Initial population dips of ~900+ tended to survive, while lower dips would proceed to zero. Populations rebounded, though not always completely Sampling some of the trials show that if a population survives, it fitness will also begin to increase and tasks would be evolved

Cosmic-point Mutation

Insertion and Deletion Mutations

Copy-point Mutation Copy-point mutation means that every genome site has a chance of mutating on every divide. Surviving populations would crash to a very small number of organisms (as small as 2) Populations would begin to recover but tended to have an upper bound. Some of the trials were sampled and noted that none did any task. Sampling some of the trials, only one survival method was noted –Due to the local replacement problem, a viable organism would be immortal or would only be replaced by another viable organism.

Copy-point mutation rate vs. Probability of Extinction

Other factors? Determine the affect of genome length and population size on the probability of extinction. Copy-point mutation rates of 0.3, 0.35, and 0.53 were chosen for contrast based on their P(e) values (high, medium, low)

Genome Length vs. Mutation Rate

Population Size vs. Mutation Rate

Relationship to common mutation rates An examination of copy-point mutations at common values How are dominant fitness and the ability to do tasks affected as mutation rates get larger approaching the high extinction mutation rates? Only 20 trials were taken for each data point, due to time constraints

Mutation Rate vs. Number of Tasks

Mutation Rate vs. log Fitness

Conclusions For copy-point and cosmic-point mutation rates, we observed that there is not a hard boundary but more of a continuum for P(e). While time did not permit further mapping, we expect that curve is more of sigmoid –For copy-point mutation rates higher than 0.6, P(e) goes to 1.0 as the mutation rate goes to 1.0 –For copy-point mutation rates lower then 0.3, P(e) goes to 0.0 as the mutation rate goes to zero Survival may still be high at a copy-point mutation rate of 0.3, but it is still unsuited for evolution purposes Changing from local replacement birth method to mass action birth method would have changed the entire dynamic that was found.

Conclusions (Cont.) For insertion and deletion, there was no extinction. –The size of the resulting populations were affected –Use of the deletion only scenario would prove useful for code reduction once an end result has been evolved Genome length and population size did influence P(e) for copy-point mutations. –There is an optimal genome length where P(e) is minimized for a particular mutation rate. –Genome length can only make the probability of survival worse. –On the other hand, larger population sizes increases the survivability of a population

Thank You Any Questions?