Skip to main content

DNA Computing Model of the Integer Linear Programming Problem Based on Molecular Beacon

  • Conference paper
Computational Intelligence and Bioinformatics (ICIC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 4115))

Included in the following conference series:

  • 1422 Accesses

Abstract

Biological chip technology and DNA computing are new research areas in biology science and information science separately. The essential characteristic of both is the massive parallel of obtaining and managing information. The integer linear programming problem is an important problem in opsearch and it is an NP-complete problem. But up to now, there does not exist any good algorithm yet. A new DNA computing model is provided to solve a integer linear programming problem based on Molecular Beacon chip. In the method, the integer linear programming problem is solved with molecular beacon by fluorescing upon hybridization to their complementary DNA targets. The method has some significant advantages such as simple encoding, excellent sensitivity, high selectivity, low cost, low error, short operating time, reusable surface and simple experimental steps. The result suggest s the potential of Molecular Beacon used as a DNA computer chip.

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. Feynmam, R.P.: In: Gilbart, D.H. (ed.) Minaturization, Reinhold, New York, pp. 282–296 (1961)

    Google Scholar 

  2. Ouyang, Q.P., Kaplan, D.S., Liu, M., libchaber, A.: DNA Solution of the Maximal Clique Problem. Science 278, 446–449 (1997)

    Article  Google Scholar 

  3. Christos, H., Papadimitriou: Papadimitriou. In: Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Inc., Englewood Cliffs, New Jersey (1989)

    Google Scholar 

  4. Cox, J.C.: The Complexities of DNA Computation. Tibtech 17, 151–154 (1996)

    Google Scholar 

  5. Adleman, L.M.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1023 (1994)

    Article  Google Scholar 

  6. Lipton, R.J.: DNA Solution of Hard Computational Problems. Science 268, 542–545 (1995)

    Article  Google Scholar 

  7. Liu, Q.: DNA Computing on Surfaces. Nature 403, 175–179 (2000)

    Article  Google Scholar 

  8. Wu, H.Y.: An Improved Surface-based Method for DNA Computation. Biosystem 59, 1–5 (2001)

    Article  Google Scholar 

  9. Yin, Z.X., Zhang, F.Y.A., Xu, J.: A Chinese Postman Problem Based on DNA Computing. Journal of Chemical Information and Computing Science 42, 222–224 (2002)

    Google Scholar 

  10. Head, T.: Formal Language Theory and DNA: an Analysis of the Generative Capacity of Specific Recombinant Behaviors. Bull. Math. Biol. 49, 737–759 (1997)

    MathSciNet  Google Scholar 

  11. Liu, Q.: Progress Toward Demonstration of a Surface Based DNA Computation: a One Word Approach to Solve a Model Satisfiability Problem. Biosystems 52, 25–33 (1999)

    Article  Google Scholar 

  12. Sakamoto, K.G.A.: Hidetaka, et al.: Molecular Computation by DNA Hairpin Formation. Science 288, 1223–1226 (2000)

    Article  Google Scholar 

  13. Braich, R.S.: Solution of a 20-Variable 3-SAT Problem on a DNA Computer. Science 296, 499–502 (2002)

    Article  Google Scholar 

  14. Yin, Z.X., Zhang, F.Y.A., Xu, J.: The General Form of 0-1 Programming Problem Based on DNA Computing. Biosystems 70, 73–78 (2003)

    Article  Google Scholar 

  15. Wang, S.Y.A., Yang, A.M.: DNA Solution of Integer Linear Programming. Applied Mathematics and Computation 17, 626–632 (2005)

    Article  Google Scholar 

  16. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press LTD, New York (1976)

    Google Scholar 

  17. Gass, S.L.: Linear Programming Methods and Applications, 5th edn. Mc Graw Hill Book company (1988)

    Google Scholar 

  18. Wang, Y.J., Wang, H., Lie, L.B., et al.: The Molecular Beacon Technology. Hua xue tong bao 67(12), 912–918 (2004)

    Google Scholar 

  19. Fang, X.H., Liu, X.J., Schuster, S., et al.: Designing a Novel Molecular Beacon for Surface Immobilized DNA Hybridization Studies. J. Am. Chem. Soc. 121, 2921–2922 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yin, Zx., Cui, Jz., Yang, J., Xu, J. (2006). DNA Computing Model of the Integer Linear Programming Problem Based on Molecular Beacon. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence and Bioinformatics. ICIC 2006. Lecture Notes in Computer Science(), vol 4115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816102_26

Download citation

  • DOI: https://doi.org/10.1007/11816102_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37277-6

  • Online ISBN: 978-3-540-37282-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics