Gene Expression and Fast Construction of Distributed Evolutionary Representation

The gene expression process in nature produces different proteins in different cells from different portions of the DNA. Since proteins control almost every important activity in a living organism, at an abstract level, gene expression can be viewed as a process that evaluates the merit or fitness of the DNA. This distributed evaluation of the DNA would not be possible without a decomposed representation of the fitness function defined over the DNAs. This paper argues that, unless the living body was provided with such a representation, we have every reason to believe that it must have an efficient mechanism to construct this distributed representation. This paper demonstrates polynomial-time computability of such a representation by proposing a class of efficient algorithms. The main contribution of this paper is two-fold. On the algorithmic side, it offers a way to scale up evolutionary search by detecting the underlying structure of the search space. On the biological side, it proves that the distributed representation of the evolutionary fitness function in gene expression can be computed in polynomial-time. It advances our understanding about the representation construction in gene expression from the perspective of computing. It also presents experimental results support-ing the theoretical performance of the proposed algorithms.

[1]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

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

[3]  J. Monod,et al.  Genetic regulatory mechanisms in the synthesis of proteins. , 1961, Journal of Molecular Biology.

[4]  Fernando G. Lobo,et al.  Compressed introns in a linkage learning genetic algorithm , 1998 .

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

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[8]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.

[9]  H. Muhlenbein,et al.  Gene pool recombination and utilization of covariances for the Breeder Genetic Algorithm , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

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

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

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

[13]  G. Kane.  Parallel Distributed Processing: Explorations in the Microstructure of Cognition, vol 1: Foundations, vol 2: Psychological and Biological Models , 1994 .

[14]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

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

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

[17]  G. Harik.  Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms , 1997 .

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

[19]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms Revisited: Studies in Mixed Size and Scale , 1990, Complex Syst..

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

[21]  R. Rosenberg.  Simulation of genetic populations with biochemical properties : technical report , 1967 .

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

[23]  Albert Donally Bethke,et al.  Genetic Algorithms as Function Optimizers , 1980 .

[24]  D. R. McGregor,et al.  Designing application-specific neural networks using the structured genetic algorithm , 1992, [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks.

[25]  Jan Paredis,et al.  The Symbiotic Evolution of Solutions and Their Representations , 1995, International Conference on Genetic Algorithms.

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

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

[28]  David E. Goldberg,et al.  Linkage Identification by Non-monotonicity Detection for Overlapping Functions , 1999, Evolutionary Computation.

[29]  L. Debnath,et al.  Walsh Functions and Their Applications , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[30]  Daniel Raymond Frantz,et al.  Nonlinearities in genetic adaptive search. , 1972 .

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

[32]  Eyal Kushilevitz,et al.  Learning Decision Trees Using the Fourier Spectrum , 1993, SIAM J. Comput..

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

[34]  Paul J. Kennedy.  Simulation Of The Evolution Of Single Celled Organisms With Genome, Metabolism And Time-Varying Phen , 1998 .

[35]  David E. Goldberg,et al.  The Nonuniform Walsh-Schema Transform , 1990, FOGA.

[36]  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.

[37]  W. Banzhaf,et al.  Genetic programming using genotype-phenotype mapping from linear genomes into linear phenotypes , 1996 .

[38]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[39]  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).

[40]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[41]  Cees H. M. van Kemenade.  Explicit Filtering of Building Blocks for Genetic Algorithms , 1996, PPSN.

[42]  Hillol Kargupta.  Gene expression: The missing link in evolutionary computation , 1997 .

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

[44]  Ryszard S. Michalski,et al.  A theory and methodology of inductive learning , 1993 .

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

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

[47]  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).

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

[49]  Christian M. Reidys,et al.  Evolution on Random Structures , 1995 .

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

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

[52]  K. Deb.  Binary and floating-point function optimization using messy genetic algorithms , 1991 .

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

[54]  Kalyanmoy Deb,et al.  RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.

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

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

[57]  S. Baluja,et al.  Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space , 1997 .

[58]  David E. Goldberg,et al.  Learning Linkage , 1996, FOGA.

[59]  Sami Khuri,et al.  Walsh and Haar functions in genetic algorithms , 1994, SAC '94.

[60]  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.

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

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

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

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

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

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

[67]  Jim Smith,et al.  Recombination strategy adaptation via evolution of gene linkage , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[68]  Sanza T. Kazadi,et al.  Conjugate Schema in Genetic Search , 1997, ICGA.

[69]  James R. Levenick.  Inserting Introns Improves Genetic Algorithm Success Rate: Taking a Cue from Biology , 1991, ICGA.

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

[71]  J. David Schaffer,et al.  An Adaptive Crossover Distribution Mechanism for Genetic Algorithms , 1987, ICGA.

[72]  Heinz Mühlenbein,et al.  FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.

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

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

[75]  Kalyanmoy Deb,et al.  Don't Worry, Be Messy , 1991, ICGA.

[76]  James L. McClelland,et al.  Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

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