Skip to main content
SpringerLink
Log in
Book cover

Soft Computing as Transdisciplinary Science and Technology pp 1278–1287Cite as

DNA-based Algorithm for 0–1 Planning Problem

  • Conference paper

  • 870 Accesses

Part of the book series: Advances in Soft Computing ((AINSC,volume 29))

Abstract

Biochemical reaction theory based DNA computation is of much better performance in solving a class of intractable computational problems such as NP-complete problems, it is important to study the DNA computation. A novel algorithm based on DNA computation is proposed, which solves the 0–1 planning problem finally by using the surface-based fluorescence labeling technique.

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   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gao Lin, Xu Jin. (2003) DNA solution of vertex cover problem based on sticker model. Chinese Journal of Electronics. Vol.15, No.1:1496–1500.

    Google Scholar 

  2. Bach, E. et. al. (1999) DNA Models and Algorithms for NP-Complete Problems. Proceedings of the 11th Annual Meeting on DNA Based Computers. Vol.44: 151–161.

    Google Scholar 

  3. Xu Jin, Zhang Lei. (2003) DNA Computer Principle, Advances and Difficulties (1): Biological Computing System and Its Applications to Graph Theory. Chinese Journal of Computers. Vol.26, No.1: 1–11.

    MathSciNet  Google Scholar 

  4. Frank G, Makiko F. Carter B. (1996) Making DNA add. Science. Vol.273: 220–223.

    Article  Google Scholar 

  5. Yurke B, Mills Jr. A P. Cheng Siu Lai. (1999) DNA implementation of addition in which the input strands are separate from the operator strands. Bio-systems. Vol.52: 165–174.

    Google Scholar 

  6. Oliver J S. (1999) Computation with DNA: Matrix multiplication. DIAMACS series. Discrete Mathematics and Theoretical Computer Science. Vol.52: 165–171.

    Google Scholar 

  7. Alderman, L. M. (1994) Molecular computations to combinatorial problems. Science. Vol.266: 1021–1024

    Article  Google Scholar 

  8. R Lipton. (1995) Using DNA to solve NP-Complete Problems. Science. Vol.268: 542–545.

    Article  Google Scholar 

  9. Sakamoto et.al. (2000) Molecular computation by DNA hairpin formation. Science. Vol.288, No.5: 1223–1226.

    Article  Google Scholar 

  10. Liu Q, Guo Z, Fei Z et al. (1999) A surface based approach to DNA computation. Discrete Mathmatics and Theoretical Computer Science. Vol.44: 123–132.

    MathSciNet  Google Scholar 

  11. Wu Hao-Yang. (2001) An improved surface based method for DNA computation. Bio-systems. Vol.59: 1–5.

    Google Scholar 

  12. Yin Zhixiang, Zhang Fengyue, Xu Jin. (2003) 0-1 planning problem based on DNA computing. Chinese Journal of electronics and Information. Vol.15, No.1:1–5.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Fujian University of Technology, Fuzhou, Fujian, RP China, 350014

    Wang Lei, Chen Zhiping, Jiang Xinhua & Liu Shaoli

Authors
  1. Wang Lei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chen Zhiping
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiang Xinhua
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Liu Shaoli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, Oklahoma State University, North Greenwood Avenue 700, 74106, Tulsa, USA

    Ajith Abraham

  2. Dept. of Computer Science and Systems Engineering, Muroran Institute of Technology, Mizumoto-cho 27-1, 050-8585, Muroran, Hokkaido, Japan

    Yasuhiko Dote

  3. Dept. of Computational Science and Engineering, Nagoya University, Furo-cho, Chikusa-ku, 464-8601, Nagoya, Aichi-ken, Japan

    Takeshi Furuhashi

  4. Institut für Sicherheits-/Prüftechnik, Fraunhofer IPK Berlin, Pascalstr. 8-9, 10587, Berlin, Germany

    Mario Köppen

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

    Azuma Ohuchi

  6. PRESTO Japan Science & Technology Corp. GSSM, University of Tsukuba, 3-29-1 Otsuka, Bunkyo-ku, 12-0012, Tokyo, Japan

    Yukio Ohsawa

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lei, W., Zhiping, C., Xinhua, J., Shaoli, L. (2005). DNA-based Algorithm for 0–1 Planning Problem. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_130

Download citation

  • DOI: https://doi.org/10.1007/3-540-32391-0_130

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-32391-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation