Skip to main content
SpringerLink
Log in

NACST/Seq: A Sequence Design System with Multiobjective Optimization

  • Conference paper
  • First Online:
DNA Computing (DNA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2568))

Included in the following conference series:

Abstract

The importance of DNA sequence design for reliable DNA computing is well recognized. In this paper, we describe a DNA sequence optimization system NACST/Seq that is based on a multiobjective genetic algorithm. It uses the concept of Pareto optimization to reflect many realistic characteristics of DNA sequences in real bio-chemical experiments flexibly. This feature allows to recommend multiple candidate sets as well as to generate the DNA sequences, which fit better to a specific DNA computing algorithm. We also describe DNA sequence analyzer that can examine and visualize the properties of given DNA sequences.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. R. Deaton, R. C. Murphy, M. Garzon, D. R. Franceschetti, and S. E. Stevens Jr., “Good encodings for DNA-based solutions to combinatorial problems,” in Proceedings of the Second Annual Meeting on DNA Based Computers, 1996.

    Google Scholar 

  2. R. Deaton, R. C. Murphy, M. Garzon, D. R. Franceschetti, and S. E. Stevens Jr., “Genetic search of reliable encodings for DNA based computation,” Late-Breaking papers at the First Genetic Programming Conference, pp. 9–15, 1996.

    Google Scholar 

  3. R. Deaton, M. Garzon, J. A. Rose, D. R. Franceschetti, R. C. Murphy, and S. E. Stevens Jr., “Reliability and efficiency of a DNA-based computation,” Physical Review Letters, vol. 80, no. 2, pp. 417–420, 1998.

    Article  Google Scholar 

  4. M. Garzon, P. Neathery, R. Deaton, R. C. Murphy, D. R. Franceschetti, and S.E. Stevens Jr., “A new metric for DNA computing,” in Proceedings of Genetic Programming 1997., The MIT Press. pp. 472–478, 1997.

    Google Scholar 

  5. A. Marathe, A. E. Condon, and R. M. Corn, “On combinatorial DNA word design,” in Proceedings of 5th DIMACS Workshop on DNA Based Computers, pp. 75–89, 1999.

    Google Scholar 

  6. A. G. Frutos, A. J. Thiel, A. E. Condon, L. M. Smith, and R. M. Corn, “DNA computing at surfaces: 4ba se mismatch word design,” in Proceedings of 3rd DIMACS Workshop on DNA Based Computers, pp. 238, 1997.

    Google Scholar 

  7. A. J. Hartemink, D. K. Gifford, and J. Khodor, “Automated constraint-based nucleotide sequence selection for DNA computation,” in Proceedings of 4th DIMACS Workshop on DNA Based Computers, pp. 227–235, 1998.

    Google Scholar 

  8. U. Feldkamp, S. Sagha., and H. Rauhe, “DNASequenceGenerator — A program for the construction of DNA sequences,” in Preliminary Proceedings of 7th international Workshop on DNA-Based Computers, pp. 179–188, 2001.

    Google Scholar 

  9. M. Arita, A. Nishikawa, M. Hagiya, K. Komiya, H. Gouzu, and K. Sakamoto, “Improving sequence design for DNA computing,” in Proceedings of Genetic and Evolutionary Computation Conference 2000, pp. 875–882, 2000.

    Google Scholar 

  10. F. Tanaka, M. Nakatsugawa, M. Yamamoto, T. Shiba, and A. Ohuchi, “Developing support system for sequence design in DNA computing,” in Preliminary Proceedings of 7th international Workshop on DNA-Based Computers, pp. 340–349, 2001.

    Google Scholar 

  11. S.-Y. Shin, D. Kim, I.-H. Lee, and B.-T. Zhang, “Evolutionary sequence generation for reliable DNA computing,” Congress on Evolutionary Computation 2002,, 2002. (Accepted)

    Google Scholar 

  12. A. J. Ruben, S. J. Freeland, and L. Landweber, “PUNCH: an evolutionary algorithm for optimizing bit set selection,” in Preliminary Proceedings of 7th International Workshop on DNA-Based Computers, pp. 260–270, 2001.

    Google Scholar 

  13. R. Deaton, R. C. Murphy, J. A. Rose, M. Garzon, D. R. Franceschetti, and S. E. Stevens Jr., “A DNA Based Implementation of an Evolutionary Search for Good Encodings for DNA Computation,” in Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pp. 267–272, 1997.

    Google Scholar 

  14. B.-T. Zhang and S.-Y. Shin, “Code optimization for DNA computing of maximal cliques,” in Advances in Soft Computing-Engineering Design and Manufacturing., Springer., 1999.

    Google Scholar 

  15. N. Srinivas, “Multiobjective optimization using nondominated sorting in genetic algorithms,” Evolutionary Computation, vol. 3, no. 2, pp. 221–248, 1995.

    Google Scholar 

  16. S.-Y. Shin, D. Kim, I.-H. Lee, and B.-T. Zhang, “Multiobjective evolutionary algorithms to design error-preventing DNA sequences,” Parallel Problem Solving from Nature VII, 2002. (Submitted)

    Google Scholar 

  17. M. Hagiya, M. Arita, D. Kiga, K. Sakamoto, and S. Yokoyama, “Towards parallel evaluation and learning of Boolean μ-formulas with molecules,” DNA Based Computers III, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 48, pp. 57–72, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Biointelligence LaboratorySchool of Computer Science and Engineering, Seoul National University, 151-742, Seoul, Korea

    Dongmin Kim, Shin Soo-Yong, Lee In-Hee & Zhang Byoung-Tak

Authors
  1. Dongmin Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shin Soo-Yong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lee In-Hee
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhang Byoung-Tak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Toyko Graduate School of Information Science and Technology, 7-3-1 Hongo, Bunkyo-ku, 113-8565, Tokyo, Japan

    Masami Hagiya

  2. Division of Complex Systems Technology, Hokkaido University Graduate School of Engineering, N-13, W-8, KITA-KU, 060, Sapporo, Japan

    Azuma Ohuchi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, D., Soo-Yong, S., In-Hee, L., Byoung-Tak, Z. (2003). NACST/Seq: A Sequence Design System with Multiobjective Optimization. In: Hagiya, M., Ohuchi, A. (eds) DNA Computing. DNA 2002. Lecture Notes in Computer Science, vol 2568. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36440-4_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-36440-4_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00531-5

  • Online ISBN: 978-3-540-36440-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation