T HE EVOLUTIONARY computation community lost one of its pioneers on July 14, 2002, when Alex S. Fraser passed away as a result of complications from a heart attack. Fraser was one of the first to conceive and execute computer simulations of genetic systems, and his efforts in the 1950s and 1960s had a profound impact on computational models of evolutionary systems. The simulation algorithms he used were important not only in the simulation of genetical problems, but provided a menu of techniques that enriched the entire simulation effort in any problem that involved probability sampling among a population of alternatives, the heart of Monte Carlo methods. Fraser was born in London, U.K., and lived in Hong Kong for most of his youth; however, he studied at the University of New Zealand, and later went to the University of Edinburgh, and subsequently to the Commonwealth Scientific and Industrial Research Organisation (CSIRO) in Sydney, Australia. It was at the CSIRO where Fraser made his seminal contributions to evolutionary computation. Following the construction of the ILLIAC computer at the University of Chicago, CSIRO designed and built their own version, called the SILLIAC, and Fraser began using it to simulate genetic selection processes. Beginning with [1], Fraser embarked on a comprehensive series of simulations of evolutionary processes [2]–[13], and encouraged and collaborated with others on many related publications in this series [14]–[18]. Fraser published extensively in the Australian Journal of Biological Sciences , and his efforts influenced colleagues in evolutionary biology significantly [19]–[21]. Fraser’s first efforts [1], published in 1957, studied the case of diploid organisms represented by binary strings of a given length, say . Each bit in a string represented an allele (either dominant or recessive) and the phenotype of each organism was determined by its genetic composition. Reproduction was accomplished using an-point crossover operator where each position along an organism’s genetic string was assigned a proba-
[1]
Jack L Crosby,et al.
The evolution of genetic discontinuity: Computer models of the selection of barriers to interbreeding between subspecies
,
1970,
Heredity.
[2]
David H. Wolpert,et al.
No free lunch theorems for optimization
,
1997,
IEEE Trans. Evol. Comput..
[3]
Alex Fraser,et al.
Simulation of Genetic Systems by Automatic Digital Computers I. Introduction
,
1957
.
[4]
David B. Fogel,et al.
Evolutionary Computation: The Fossil Record
,
1998
.
[5]
D. B. Fogel,et al.
Running races with Fraser's recombination
,
2000,
Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).
[6]
Selection and linkage in simulated genetic populations.
,
1965,
Australian journal of biological sciences.
[7]
A. Fraser.
Simulation of Genetic Systems by Automatic Digital Computers VI. Epistasis
,
1960
.
[8]
J. S. F. Barker,et al.
Simulation of Genetic Systems by Automatic Digital Computers IV. Selection Between Alleles at a Sex-Linked Locus
,
1958
.
[9]
Henry Gee.
Evolution by computer
,
1998
.
[10]
A. Fraser,et al.
Simulation of genetic systems. XII. Models of inversion polymorphism.
,
1967,
Genetics.
[11]
J. S. F. Barker,et al.
Simulation of Genetic Systems by Automatic Digital Computers
,
1958
.
[12]
A. S. FRASER,et al.
Monte Carlo Analyses of Genetic Models
,
1958,
Nature.
[13]
J. L. Crosby,et al.
The use of electronic computation in the study of random fluctuations in rapidly evolving populations
,
1960,
Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences.
[14]
J L GILL.
EFFECTS OF FINITE SIZE ON SELECTION ADVANCE IN SIMULATED GENETIC POPULATIONS.
,
1965,
Australian journal of biological sciences.
[15]
A. Fraser,et al.
Simulation of genetic systems. XI. Inversion polymorphism.
,
1966,
American journal of human genetics.
[16]
Alex Fraser.
Simulation of genetic systems
,
1962
.