Gene expression and scalable genetic search

Gene expression evaluates the genetic fitness of an organism through a sequence of representation transformations (DNA→mRNA→Protein). Moreover it does so in a very distributed and decomposed fashion by evaluating different portions of the DNA in order to produce various proteins in different body cells. This chapter reviews some of the recent results that underscore the possible critical role of gene expression in scalable genetic search. It considers a Fourier basis representation to analyze genetic fitness functions and shows that polynomial-time construction of a decomposed representation in the Fourier basis is possible when the function has a polynomial-size description. It also points out that genetic code-like transformations may offer us a unique technique to transform some functions of exponential description in the Fourier basis to an exponentially long representation with only a polynomial number of terms that are exponentially more significant than the rest. This may be useful for a polynomial-time approximation of an exponential description. Since the construction of decomposed representation of functions from observed data plays an important role in machine learning, data mining, and black-box optimization, the role of gene expression in scalable genetic search appears quite critical.

[1]  Alden H. Wright,et al.  The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory , 1998, Evolutionary Computation.

[2]  J Otsuka,et al.  Evolution of genetic information flow from the viewpoint of protein sequence similarity. , 1994, Journal of theoretical biology.

[3]  D. Ackley.  A connectionist machine for genetic hillclimbing , 1987 .

[4]  M. Shackleton,et al.  An investigation of redundant genotype-phenotype mappings and their role in evolutionary search , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[5]  Hillol Kargupta,et al.  A perspective on the foundation and evolution of the linkage learning genetic algorithms , 2000 .

[6]  P. Schuster.  The Role of Neutral Mutations in the Evolution of RNA Molecules , 1997 .

[7]  Gang Wang,et al.  Revisiting the GEMGA: scalable evolutionary optimization through linkage learning , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[8]  J. Bashford,et al.  A supersymmetric model for the evolution of the genetic code. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Hiroaki Kitano,et al.  Identifying Gene Regulatory Networks from Time Series Expression Data by in silico Sampling and Screening , 1999, ECAL.

[10]  Stuart A. Kauffman,et al.  ORIGINS OF ORDER , 2019, Origins of Order.

[11]  Gunar E. Liepins,et al.  Polynomials, Basis Sets, and Deceptiveness in Genetic Algorithms , 1991, Complex Syst..

[12]  L. Darrell Whitley,et al.  Predicting Epistasis from Mathematical Models , 1999, Evolutionary Computation.

[13]  Sanghamitra Bandyopadhyay,et al.  Further Experimentations on the Scalability of the GEMGA , 1998, PPSN.

[14]  Annie S. Wu,et al.  Empirical Studies of the Genetic Algorithm with Noncoding Segments , 1995, Evolutionary Computation.

[15]  John Daniel. Bagley,et al.  The behavior of adaptive systems which employ genetic and correlation algorithms : technical report , 1967 .

[16]  Dirk Thierens.  Estimating the significant non-linearities in the genome problem-coding , 1999 .

[17]  Shōzō Ōsawa,et al.  Evolution of the genetic code , 1995 .

[18]  J. C. Jackson.  The harmonic sieve: a novel application of Fourier analysis to machine learning theory and practice , 1996 .

[19]  B. Sankur,et al.  Applications of Walsh and related functions , 1986 .

[20]  Zoubin Ghahramani,et al.  Modular decomposition in visuomotor learning , 1997, Nature.

[21]  Melanie Mitchell,et al.  The Performance of Genetic Algorithms on Walsh Polynomials: Some Anomalous Results and Their Explanation , 1991, ICGA.

[22]  Hillol Kargupta,et al.  Gene Expression and Fast Construction of Distributed Evolutionary Representation , 2001, Evolutionary Computation.

[23]  L. Darrell Whitley,et al.  A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms , 1998, AAAI/IAAI.

[24]  Kwong-Sak Leung,et al.  Applying logic grammars to induce sub-functions in genetic programming , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[25]  Peter F. Stadler,et al.  Fast Fourier Transform for Fitness Landscapes , 2002 .

[26]  P Béland,et al.  The origin and evolution of the genetic code. , 1994, Journal of theoretical biology.

[27]  A. D. Bethke,et al.  Comparison of genetic algorithms and gradient-based optimizers on parallel processors : efficiency of use of processing capacity , 1976 .

[28]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis , 1989, Complex Syst..

[29]  J. Walsh.  A Closed Set of Normal Orthogonal Functions , 1923 .

[30]  Michael O'Neill,et al.  Grammatical Evolution: Evolving Programs for an Arbitrary Language , 1998, EuroGP.

[31]  Lashon B. Booker,et al.  Proceedings of the fourth international conference on Genetic algorithms , 1991 .

[32]  Eyal Kushilevitz,et al.  Learning decision trees using the Fourier spectrum , 1991, STOC '91.

[33]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[34]  Alden H. Wright,et al.  The Simple Genetic Algorithm and the Walsh Transform: Part II, The Inverse , 1998, Evolutionary Computation.

[35]  Wolfgang Banzhaf,et al.  The evolution of genetic code in Genetic Programming , 1999 .

[36]  Hillol Kargupta,et al.  SEARCH, Computational Processes in Evolution, and Preliminary Development of the Gene Expression Messy Genetic Algorithm , 1997, Complex Syst..

[37]  J. Monod,et al.  Genetic regulatory mechanisms in the synthesis of proteins. , 1961, Journal of molecular biology.

[38]  Hillol Kargupta,et al.  Extending the class of order-k delineable problems for the gene expression messy genetic algorithm , 1996 .

[39]  Hillol Kargupta,et al.  The Genetic Code-Like Transformations and Their Effect on Learning Functions , 2000, PPSN.

[40]  Hillol Kargupta,et al.  A Striking Property of Genetic Code-like Transformations , 2001, Complex Syst..

[41]  Hornos.  Algebraic model for the evolution of the genetic code. , 1993, Physical review letters.

[42]  S. Suhai.  Theoretical and Computational Methods in Genome Research , 2012, Springer US.

[43]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[44]  Anne Brindle,et al.  Genetic algorithms for function optimization , 1980 .

[45]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..

[46]  David E. Goldberg,et al.  SEARCH, Blackbox Optimization, And Sample Complexity , 1996, FOGA.

[47]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[48]  Hillol Kargupta,et al.  The Gene Expression Messy Genetic Algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[49]  Geoffrey E. Hinton,et al.  Adaptive Mixtures of Local Experts , 1991, Neural Computation.

[50]  Dirk Thierens,et al.  Scalability Problems of Simple Genetic Algorithms , 1999, Evolutionary Computation.

[51]  Hillol Kargupta,et al.  Function induction, gene expression, and evolutionary representation construction , 1999 .