Skip to main content

A Phenomic Approach to Genetic Algorithms for Reconstruction of Gene Networks

  • Conference paper
Contemporary Computing (IC3 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 94))

Included in the following conference series:

  • 1129 Accesses

Abstract

Genetic algorithms require a fitness function to evaluate individuals in a population. The fitness function essentially captures the dependence of the phenotype on the genotype. In the Phenomic approach we represent the phenotype of each individual in a simulated environment where phenotypic interactions are enforced. In reconstruction type of problems, the model is reconstructed from the data that maps the input to the output. In the phenomic algorithm, we use this data to replace the fitness function. Thus we achieve survival-of-the-fittest without the need for a fitness function. Though limited to reconstruction type problems where such mapping data is available, this novel approach nonetheless overcomes the daunting task of providing the elusive fitness function, which has been a stumbling block so far to the widespread use of genetic algorithms. We present an algorithm called Integrated Pheneto-Genetic Algorithm (IPGA), wherein the genetic algorithm is used to process genotypic information and the phenomic algorithm is used to process phenotypic information, thereby providing a holistic approach which completes the evolutionary cycle. We apply this novel evolutionary algorithm to the problem of elucidation of gene networks from microarray data. The algorithm performs well and provides stable and accurate results when compared to some other existing algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldberg, D.E.: Genetic Algorithms for Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)

    Google Scholar 

  2. Deb, K.: Multi-objective Optimization using Evolutionary Algorithms. Wiley, Chichester (2001)

    MATH  Google Scholar 

  3. Lewis, P.S., Mosher, J.C.: Genetic algorithms for neuromagnetic source reconstruction. In: 1994 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1994, Adelaide, vol. 5, pp. 293–296 (1994)

    Google Scholar 

  4. Munshi, P.: X-ray and ultrasonic tomography. Insight - Non-Destructive Testing and Condition Monitoring 45(1), 47–50 (2003)

    Article  Google Scholar 

  5. Kodali, S.P., Bandaru, S., Deb, K., Munshi, P., Kishore, N.N.: Applicability of genetic algorithms to reconstruction of projected data from ultrasonic tomography. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, Atlanta, pp. 1705–1706 (2008)

    Google Scholar 

  6. Mou, C., Peng, L., Yao, D., Xiao, D.: Image Reconstruction Using a Genetic Algorithm for Electrical Capacitance Tomography. Tsinghua Science & Technology, Science Direct  10(5), 587–592 (2005)

    Google Scholar 

  7. Li, X., Kodama, T., Uchikawa, Y.: A reconstruction method of surface morphology with genetic algorithms in the scanning electron microscope. J. Electron Microscopy (Tokyo) 49(5), 599–606 (2000)

    Google Scholar 

  8. Huang, C.-H., Lu, H.-C., Chiu, C.-C., Wysocki, T.A., Wysocki, B.J.: Image reconstruction of buried multiple conductors by genetic algorithms. International Journal of Imaging Systems and Technology 18(4), 276–281 (2008)

    Article  Google Scholar 

  9. Xiyu, L., Mingxi, T., Frazer, J.H.: Shape reconstruction by genetic algorithms and artificial neural networks. Engineering Computations 20(2), 129–151 (2003)

    Article  MATH  Google Scholar 

  10. Fayolle, P.-A., Rosenberger, C., Toinard, C.: 3D Shape Reconstruction of Template Models Using Genetic Algorithms. In: 17th International Conference on Pattern Recognition (ICPR 2004), vol. 2, pp. 269–272 (2004)

    Google Scholar 

  11. Somogyi, R., Fuhrman, S., Askenazi, M., Wuensche, A.: The gene expression matrix: towards the extraction of genetic network architectures. In: Proc. of Second World Cong. of Nonlinear Analysts (WCNA 1996), vol. 30(3), pp. 1815–1824 (1996)

    Google Scholar 

  12. Liang, S., Fuhrman, S., Somogyi, R.: REVEAL, a general reverse engineering algorithm for inference of genetic network architectures. In: Pacific Symp. on Biocomputing, vol. 3, pp. 18–29 (1998)

    Google Scholar 

  13. Akutsu, T., Miyano, S., Kuhara, S.: Identification of genetic networks from a small number of gene expression patterns under the boolean network model. In: Pacific Symp. on Biocomputing, vol. 4, pp. 17–28 (1999)

    Google Scholar 

  14. Akutsu, T., Miyano, S., Kuhara, S.: Algorithms for inferring qualitative models of biological networks. In: Pacific Symp. on Biocomputing (2000)

    Google Scholar 

  15. D’haeseleer, P., Liang, S., Somogyi, R.: Genetic network inference: from co-expression clustering to reverse engineering. Bioinformatics 16(8), 707–726 (2000)

    Article  Google Scholar 

  16. Savageau, M.A.: Power-law formalism: a canonical nonlinear approach to modeling and analysis. In: Proceedings of the World Congress of Nonlinear Analysts 1992, pp. 3323–3334 (1992)

    Google Scholar 

  17. Spieth, C., Streichert, F., Speer, N., Zell, A.: Optimizing Topology and Parameters of Gene Regulatory Network Models from Time Series Experiments. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 461–470. Springer, Heidelberg (2004)

    Google Scholar 

  18. Noman, N., Iba, H.: Reverse engineering genetic networks using evolutionary computation. Genome Informatics 16(2), 205–214 (2005)

    Google Scholar 

  19. Lubovac, Z., Olsson, B.: Towards reverse engineering of genetic regulatory networks. Technical Report No. HS-IDA-TR-03-003, University of Skovde, Sweden (2003)

    Google Scholar 

  20. Kampis, G.: A Causal Model of Evolution. In: Proc. of 4th Asia-Pacific Conf. on Simulated Evol. and Learning (SEAL 2002), pp. 836–840 (2002)

    Google Scholar 

  21. Dawkins, R.: The blind watchmaker. Penguin Books (1988)

    Google Scholar 

  22. D’Souza, R.G.L., Chandra Sekaran, K., Kandasamy, A.: A Phenomic Algorithm for Reconstruction of Gene Networks. In: IV International Conference on Computational Intelligence and Cognitive Informatics, Venice, CICI 2007, WASET, pp. 53–58 (2007)

    Google Scholar 

  23. D’Souza, R.G.L., Chandra Sekaran, K., Kandasamy, A.: Reconstruction of Gene Networks Using Phenomic Algorithms. International Journal of Artificial Intelligence and Applications (IJAIA) 1(2) (2010)

    Google Scholar 

  24. Chu, S., DeRisi, J., Eisen, M., et al.: The transcriptional program of sporulation in budding yeast. Science 282, 699–705 (1998)

    Article  Google Scholar 

  25. Kupiec, M., Ayers, B., Esposito, R.E., Mitchell, A.P.: The molecular and cellular biology of the yeast Saccaromyces. Cold Spring Harbor, 889–1036 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

D’Souza, R.G.L., Chandra Sekaran, K., Kandasamy, A. (2010). A Phenomic Approach to Genetic Algorithms for Reconstruction of Gene Networks. In: Ranka, S., et al. Contemporary Computing. IC3 2010. Communications in Computer and Information Science, vol 94. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14834-7_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14834-7_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14833-0

  • Online ISBN: 978-3-642-14834-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics