Skip to main content
SpringerLink
Log in
Book cover

Advances in Evolutionary Computing pp 293–319Cite as

Gene Expression and Scalable Genetic Search

  • Chapter

Part of the book series: Natural Computing Series ((NCS))

Abstract

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 Fourier1 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 codelike 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.

This chapter reviews material from earlier published papers of the author [27,28,34].

The analysis is identical to that using the Wash basis [5,57]; however, the author choose the term Fourier because of its historical [39,21] use in the function approximation literature.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ackley, D. H. (1987) A connectionist machine for genetic hill climbing. Kluwer Academic, Boston

    Book  Google Scholar 

  2. Bagley, J. D. (1967) The behavior of adaptive systems which employ genetic and correlation algorithms. Dissertation Abstracts International, 28, 5106B (University Microfilms No. 68–7556)

    Google Scholar 

  3. Bandyopadhyay, S., Kargupta, H., Wang, G. (1997) Revisiting the GEMGA: Scalable evolutionary optimization through linkage learning. In Proceedings of the IEEE International Conference on Evolutionary Computation, 603–608 IEEE Press, Piscateway, NJ

    Google Scholar 

  4. Bashford, J., Tsohantjis, I., Jarvis, P. (1998) A supersymmetric model for the evolution of the genetic code. Proceedings of the National Academy of Science USA, 95, 987–995

    Article  Google Scholar 

  5. Beauchamp, K. G. (1984) Applications of Walsh and Related Functions. Academic Press, USA

    Google Scholar 

  6. Beland, P., Allen, T. (1994) The origin and evolution of the genetic code. Journal of Theoretical Biology, 170, 359–365

    Article  Google Scholar 

  7. Bethke, A. D. (1976) Comparison of genetic algorithms and gradient-based optimizers on parallel processors: Efficiency of use of processing capacity. Tech. Rep. No. 197, University of Michigan, Logic of Computers Group, Ann Arbor

    Google Scholar 

  8. Brindle, A. (1981) Genetic Algorithms for Function Optimization. Unpublished doctoral dissertation, Department of Computer Science, University of Alberta, Edmonton, Canada

    Google Scholar 

  9. Dasgupta, D., McGregor, D. R. (1992) Designing neural networks using the structured genetic algorithm. Artifical Neural Networks, 2, 263–268

    Google Scholar 

  10. Forrest, S., Mitchell, M. (1991) The performance of genetic algorithms on Walsh polynomials: Some anomalous results and their explanation. In R. K. Belew and L. B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, 182–189. Morgan Kaufmann, San Mateo, CA

    Google Scholar 

  11. Freeman, J. J. (1998) A linear representation for GP using context free grammars. In Proceedings of the 1998 Genetic Programming Conference, 72–77, MIT Press, Cambridge, MA.

    Google Scholar 

  12. Fukuchi, S., Okayama, T., Otsuka, J. Evolution of genetic information flow from the viewpoint of protein sequence similarity. Journal of Theoretical Biology, 171, 179–195

    Google Scholar 

  13. Ghahramani, Z., Wolpert, D. (1997) Modular decomposition in visuomotor learning. Nature, 386, 392–395

    Article  Google Scholar 

  14. Goldberg, D. E. (1989) Genetic algorithms and Walsh functions: Part I, a gentle introduction. Complex Systems, 3, 129–152 (Also TCGA Report 88006)

    MathSciNet  MATH  Google Scholar 

  15. Goldberg, D. E. (1989) Genetic algorithms and Walsh functions: Part II, deception and its analysis. Complex Systems, 3, 153–171 (Also TCGA Report 89001)

    MathSciNet  MATH  Google Scholar 

  16. Goldberg, D.E., Korb, B., Deb, K. (1989) Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3, 493–530 (Also TCGA Report 89003)

    MathSciNet  MATH  Google Scholar 

  17. Heckendorn, R., Whitley, D. (1999) Predicting epistasis from mathematical models. Journal of Evolutionary Computation, 7, 69–101

    Article  Google Scholar 

  18. Holland, J. H. (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  19. Hollstien, R. B. (1971) Artificial genetic adaptation in computer control systems. Dissertation Abstracts International, 32(3),1510B (University Microfilms No. 71–23,773)

    Google Scholar 

  20. Hornos, J., Hornos, Y. (1993) Algebraic model for the evolution of the genetic code. Physical Review Letters, 71, 4401–4404

    Article  Google Scholar 

  21. Jackson, J. (1995) The Harmonic Sieve: A Novel Application of Fourier Analysis to Machine Learning Theory and Practice. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA

    Google Scholar 

  22. Jacob, F., Monod, J. (1961) Genetic regulatory mechanisms in the synthesis of proteins. Molecular Biology, 3, 318–356

    Article  Google Scholar 

  23. Jacobs, R.A., Jordan, M.I., Nowlan, S.J., Hinton, G.E. (1991) Adaptive mixture of local experts. Neural Computation, 3, 79–87

    Article  Google Scholar 

  24. Kargupta, H. (1996) The gene expression messy genetic algorithm. In Proceedings of the IEEE International Conference on Evolutionary Computation, 814–819. IEEE Press, Piscateway, NJ

    Chapter  Google Scholar 

  25. Kargupta, H. (1997) SEARCH, computational processes in evolution, and preliminary development of the gene expression messy genetic algorithm. Complex Systems, 11, 233–287

    MathSciNet  MATH  Google Scholar 

  26. Kargupta, H. Gene expression and large scale evolutionary optimization. In Computational Aerosciences in the 21st Century. Kluwer Academic, Boston

    Google Scholar 

  27. Kargupta, H. (1999) A striking property of genetic code-like transformations. School of EECS Technical Report EECS-99-004, Washington State University, Pullman, WA, http://www.eecs.wsu.edu/hillol/gene_expression.html

    Google Scholar 

  28. Kargupta, H. (2000) Genetic code-like transformations and their effect on learning functions. In Parallel Problem Solving from Nature 99–108 Springer-Verlag

    Google Scholar 

  29. Kargupta, H., Bandyopadhyay, S. (1998) Further experimentations on the scalability of the GEMGA. In Lecture Notes in Computer Science: Parallel Problem Solving from Nature, 315–324 Springer-Verlag, Amsterdam.

    Google Scholar 

  30. Kargupta, H., Bandyopadhyay, S. (2000) A perspective on the foundation and evolution of the linkage learning genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186 269–294, Special Issue on Genetic Algorithms, Guest Editors: Goldberg, D. E. and Deb, K.

    Google Scholar 

  31. Kargupta, H., Goldberg, D. E. (1996) SEARCH, blackbox optimization, and sample complexity. In R. Belew and M. Vose, editors, Foundations of Genetic Algorithms, 291–324 Morgan Kaufmann, San Mateo, CA.

    Google Scholar 

  32. Kargupta, H., Goldberg, D. E., Wang, L. W. (1997) Extending the class of order-k delineable problems for the gene expression messy genetic algorithm. In Proceedings of the Second Annual Conference on Genetic Programming, 364–369 Morgan Kaufmann, San Francisco Kaufmann.

    Google Scholar 

  33. Kargupta, H., Park, H. (1999) Fast construction of distributed and decomposed evolutionary representation. In Late Breaking Papers of the Genetic and Evolutionary Computation Conference, 139–148 (Extended version is in communication)

    Google Scholar 

  34. Kargupta, H., Park, H. (2000) Fast construction of distributed and decomposed evolutionary representation. Journal of Evolutionary Computation, 9: In press

    Google Scholar 

  35. Kargupta, H., Sarkar, K. (1999) Function induction, gene expression, and evolutionary representation construction. In Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, USA, 313–320; Morgan Kaufmann, San Francisco

    Google Scholar 

  36. Kauffman, S. (1993) The Origins of Order. Oxford University Press, New York

    Google Scholar 

  37. Keller, R., Banzhaf, W. (1999) The evolution of genetic code in genetic programming. In Proceedings of the Genetic and Evolutionary Computation Conference, 1077–1082. Morgan Kaufmann

    Google Scholar 

  38. Kennedy, P. (1998) Simulation of the Evolution of Single Celled Organisms with Genome, Metabolism and Time-Varying Phenotype. PhD thesis, University of Technology, Sydney, Australia

    Google Scholar 

  39. Kushilevitz, S., Mansour, Y. (1991) Learning decision trees using Fourier spectrum. In Proc 23rd Annual ACM Symp on Theory of Computing, 455–464

    Google Scholar 

  40. Liepins, G.E., Vose, M. D. (1991) Polynomials, basic sets, and deceptiveness in genetic algorithms. Complex Systems, 5, 45–61

    MathSciNet  MATH  Google Scholar 

  41. Morohashi, M., Kitano, H. Identifying gene regulatory networks from time series expression data by in silico sampling and screening. In Proceedings of the 5th European Conference on Artificial Life, 477–486. Springer-Verlag, Berlin.

    Google Scholar 

  42. Oei, C. K. (1992) Walsh function analysis of genetic algorithms of nonbinary strings. Unpublished master’s thesis, University of Illinois at Urbana-Champaign, Department of Computer Science, Urbana

    Google Scholar 

  43. Osawa, S. (1995) Evolution of the Genetic Code. Oxford University Press, New York

    Google Scholar 

  44. Rana, S., Heckendorn, R.B., Whitley, D. (1998) A tractable Walsh analysis of SAT and its implications for genetic algorithms. In Proceedings of the AAAI-98, AAAI Press

    Google Scholar 

  45. Reidys, C., Fraser, S.(1996) Evolution of random structures. Technical Report 96-11-082, Santa Fe Institute, Santa Fe, NM

    Google Scholar 

  46. Rockmore, D., Kostelec, P., Hordijk, W., Stadler, P. (1999) Fast Fourier transform for fitnes landscapes. Technical Report 99-10-068, Santa Fe Institute, Santa Fe, NM.

    Google Scholar 

  47. Rosenberg, R. S. (1967) Simulation of genetic populations with biochemical properties. Dissertation Abstracts International, 28, 2732B (University Microfilms No. 67–17,836)

    Google Scholar 

  48. Ryan, C., Collins, J. (1998) Grammatical evolution: Evolving programs for an arbitrary language. In Proceedings of the first European Workshop on Genetic Programming, 83–95. Springer-Verlag, Berlin.

    Chapter  Google Scholar 

  49. Schuster P. (1997) The role of neutral mutations in the evolution of RNA molecules. In S. Suhai, editor, Theoretical and Computational Methods in Genome Research, 287–302 Plenum Press, New York

    Chapter  Google Scholar 

  50. Shackleton, M., Shipman, R., Ebner, M. (2000) An investigation of redundant genotype-phenotype mappings and their role in evolutionary search. In Proceedings of the 2000 Congress on Evolutionary Computation, 493–500, Los Alamitos, California, IEEE Press, Piscateway, NJ

    Google Scholar 

  51. Smith, R. E. (1988) An investigation of diploid genetic algorithms for adaptive search of nonstationary functions. TCGA Report No. 88001, University of Alabama, The Clearinghouse for Genetic Algorithms, Tuscaloosa

    Google Scholar 

  52. Stadler, P. (1999) Spectral landscape theory. In J.P. Crutchfield and P. Schuster, (eds.), Evolutionary Dynamics — Exploring the Interplay of Selection, Neutrality, Accident and Function. Oxford University Press, New York

    Google Scholar 

  53. Thierens, D. (1999) Estimating the significant non-linearities in the genome problem-coding. In Proceedings of the Genetic and Evolutionary Computation Conference, 643–648, Morgan Kaufmann, San Francisco, CA

    Google Scholar 

  54. Thierens, D. (1999) Scalability problems of simple genetic algorithms. Evolutionary Computation, 7, 331–352

    Article  Google Scholar 

  55. Vose, M., Wright, A. (1998) The simple genetic algorithm and the Walsh transform: Part I, theory. Journal of Evolutionary Computation, 6, 253–274

    Article  Google Scholar 

  56. Vose, M., Wright, A. (1998) The simple genetic algorithm and the Walsh transform: Part II, the inverse. Journal of Evolutionary Computation, 6, 253–274

    Article  Google Scholar 

  57. Walsh, J. L. (1923) A closed set of orthogonal functions. American Journal of Mathematics, 45

    Google Scholar 

  58. Wong, M., Leung, K. (1995) Applying logic grammars to induce subfunctions in genetic programming. In Proceedings of the 1995 IEEE Conference on Evolutionary Computation, 737–740, USA, IEEE Press, Piscateway, NJ

    Chapter  Google Scholar 

  59. Wu, A., Lindsay, R. (1995) Empirical studies of the genetic algorithm with non-coding segments. Journal of Evolutionary Computation, 3, 121–147

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA, 99164-2752, USA

    Hillol Kargupta

Authors
  1. Hillol Kargupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Machine Intelligence Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata, 700 035, India

    Ashish Ghosh

  2. Department of Management Information, Hannan University, 5-4-33 Amamhigigashi, Matsubara, Osaka, 580-8502, Japan

    Shigeyoshi Tsutsui

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kargupta, H. (2003). Gene Expression and Scalable Genetic Search. In: Ghosh, A., Tsutsui, S. (eds) Advances in Evolutionary Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18965-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18965-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62386-8

  • Online ISBN: 978-3-642-18965-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation