Skip to main content

Toward “Wet” Implementation of Genetic Algorithm for Protein Engineering

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 3384)

Abstract

We here propose an application of DNA computing to a practical problem, protein engineering, which is difficult to approach by using modern electronic computers. DNA molecules naturally carry the blueprints of proteins. DNA-based processing of this genetic information could give mutant proteins with desired properties. We conceived the use of genetic algorithm for this purpose, and designed an algorithm amenable to DNA-based implementation. The performance of this algorithm was examined on a model fitness landscape by computer experiments. Then, spontaneous DNA recombination during PCR was utilized to embody the crossover operation in the genetic algorithm, preparing for the “wet” implementation of the whole search process in the future.

Keywords

  • Genetic Algorithm
  • Search Generation
  • Protein Engineer
  • Modern Electronic Computer
  • Crossover Site

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11493785_27
  • Chapter length: 11 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-31844-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   129.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)

    CrossRef  Google Scholar 

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

    MATH  Google Scholar 

  • Chen, J., Antipov, E., Lemieux, B., Cedeno, W., Wood, D.H.: In vitro selection for max 1s DNA genetic algorithm. In: Preliminary Proceedings of 5th International Meeting on DNA Based Computers, pp. 23–37 (1999)

    Google Scholar 

  • Kita, H., Yamamura, M.: A functional specialization hypothesis for designing genetic algorithms. In: Proceedings of 1999 IEEE International Conference on Systems, Man and Cybernetics, pp. 579–584 (1999)

    Google Scholar 

  • Kita, H., Ono, I., Kobayashi, S.: Theoretical analysis of the unimodal normal distribution crossover for real-coded genetic algorithms. In: Proceedings of 1998 International Conference on Evolutionary Computation, pp. 529–534 (1998)

    Google Scholar 

  • Kita, H., Ono, I., Kobayashi, S.: Multi parental extension of the unimodal normal distribution crossover for real-coded genetic algorithms. In: Proceedings of the 1999 Congress on Evolutionary Computation, pp. 1581–1587 (1999)

    Google Scholar 

  • Tsutsui, S., Yamamura, M., Higuchi, T.: Multi-parent recombination with simplex crossover in real coded genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference 1999, pp. 657–664 (1999)

    Google Scholar 

  • Someya, H., Yamamura, M.: Genetic algorithm with search area adaptation for the function optimization and its experimental analysis. In: Proceedings of the 2001 Congress on Evolutionary Computation, pp. 933–940 (2001)

    Google Scholar 

  • Someya, H., Yamamura, M.: Robust evolutionary algorithms with toroidal search space conversion for function optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference 2002, pp. 553–560 (2002)

    Google Scholar 

  • Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    CrossRef  MathSciNet  Google Scholar 

  • Mori, N., Yoshida, J., Tamaki, H., Kita, H., Nishikawa, Y.: A thermodynamical selection rule for the genetic algorithm. In: Proceedings of 1995 International Conference on Evolutionary Computation, pp. 188–192 (1995)

    Google Scholar 

  • Koakutsu, S., Hirata, H.: Genetic simulated annealing for floorplan design. Control and Information Sciences 197, 268–277 (1994)

    CrossRef  MathSciNet  Google Scholar 

  • Kauffman, S.A., Macready, W.G.: Search strategies for applied molecular evolution. Journal of Theoretical Biology 173, 427–440 (1995)

    CrossRef  Google Scholar 

  • Stemmer, W.P.C.: Rapid evolution of a protein in vitro by DNA shuffling. Nature 379, 389–391 (1994)

    CrossRef  Google Scholar 

  • Jansen, R., Ledley, F.D.: Disruption of phase during pcr amplification and cloning of heterozygous target sequences. Nucleic Acids Research 18, 5153–5156 (1990)

    CrossRef  Google Scholar 

  • Zhao, H., Giver, L., Affholter, J.A., Arnold, F.H.: Molecular evolution by staggered extension process (StEP) in vitro recombination. Nature biotechnology 16, 258–261 (1998)

    CrossRef  Google Scholar 

  • Landweber, L.F., Lipton, R.J., Rabin, M.O.: DNA2DNA computations: a potential “Killer App?”. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 48, 161–172 (1999)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakamoto, K., Yamamura, M., Someya, H. (2005). Toward “Wet” Implementation of Genetic Algorithm for Protein Engineering. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_27

Download citation

  • DOI: https://doi.org/10.1007/11493785_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26174-2

  • Online ISBN: 978-3-540-31844-6

  • eBook Packages: Computer ScienceComputer Science (R0)