Simulation of Genetic Systems by Automatic Digital Computers I. Introduction

Abstract

Methods of setting automatic digital computers to simulate the algebraic aspects of reproduction, segregation, and selection are discussed. The application of these methods to the problem of the importance of linkage in multifactorial inheritance is illustrated by results from the SILLIAC.

Effects of Finite Size on Selection Advance in Simulated Genetic Populations

“…This method was first developed by Schweppe and Bohidar at Iowa State University, and was used in a study by Bohidar (1960). The method is faster than the random transform of a vector of genetic recombination frequencies, which Fraser (1957a) used for a small number ofloci, and is very much faster than the random walk method which he proposed for linkage of large numbers of loci (Fraser 1960a).…”

“…His colleague Barker (1958aBarker ( , 1958b investigated selection between alleles at autosomal and sex-linked loci, showing that it is possible to simulate the operations of natural selection. Fraser (1960aFraser ( , 1960bFraser ( , 1960c) also simulated selection against phenotypic extremes and used non-linear transformations to study epista.sis, although he admitted that it is more generally valid to base any analysis of epistasis on the interactions of individual genes. Martin and Cockerham (1960) and Bohidar (1960) conducted investigations that involved Monte Carlo applications to quantitative genetic studies of selection without epistasis.…”

“…This approach enables one to study the joint effects of dominance, epistasis, linkage, and other variables upon the progress of finite genetic populations under selection. Fraser (1957aFraser ( , 1957b introduced the first techniques for the simulation of genetic systems by digital computers and studied the effects of linkage on the rate of advance under selection. His colleague Barker (1958aBarker ( , 1958b investigated selection between alleles at autosomal and sex-linked loci, showing that it is possible to simulate the operations of natural selection.…”

A genetic symbiotic algorithm applied to the one-dimensional cutting stock problem

“…According to Von Zuben (2003), genetic algorithms (GAs) are based on the works of Holland (1962), Bremermann (1962) and Fraser (1957). However, the genetic algorithm was actually introduced only in Holland's work (1975).…”

An overview of evolutionary computation

“…The origins of evolutionary algorithms can be traced to at least the 1950's (e.g., Fraser, 1957;Box, 1957). For the sake of brevity we will not concentrate on this early work but will discuss in some detail three methodologies that have emerged in the last few decades: "evolutionary programming" (Fogel et al, 1966), "evolution strategies" (Rechenberg, 1973), and "genetic algorithms" (Holland, 1975).…”