Skip to main content
  • 1118 Accesses

Summary

This paper gives a method to implement additions with one common addend in parallel by DNA computing. The main idea is to divide every addition into bit addings, and perform the bit addings of different additions in parallel. The key bio-operation used in this paper is “back-to-back” cut, which can be accomplished by restriction endonucleases.

Supported by a grant from the Ministry of Science and Technology (grant No. 2001CCA03000), National Natural Science Fund (grant No. 60496321 and No. 60273045) and Shanghai Science and Technology Development Fund (grant No. 03JC14014)

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Adleman, L.: Molecular Computation of Solutions to Combinatorial Problems. Science, 266 1021–1024 (1994)

    Google Scholar 

  2. Guarnieri, F., Fliss, M., Bancroft, C.: Making DNA add. Science, 273(5272), 220–223 (1996)

    Google Scholar 

  3. Gupta, V., Parthasarathy, S., Zaki, M.J.: Arithmetic and Logic Operations with DNA. Proceedings of the 3rd DIMACS Workshop on DNA Based Computers, 212–220 (1997)

    Google Scholar 

  4. Qiu, Z.F., Lu, M.: Arithmetic and logic operations for DNA computers. Second IASTED International Conference on Parallel and Distributed Computing and Networks, 481–486 (1998)

    Google Scholar 

  5. Hug, H., Schuler, R.: DNA-based parallel computation of simple arithmetic. 7th international Workshop on DNA-Based Computers. Tampa, U.S.A., 159–166 (2001)

    Google Scholar 

  6. Rothemund, P.: A DNA and restriction enzyme implementation of Turing Machine. In: DNA based computer. American Mathematical Society, ISBN 0-821800518-5 (1996)

    Google Scholar 

  7. Kari, L.: DNA computing: the arrival of biological mathematics. The mathematical Intelligencer, 19.2 (1997)

    Google Scholar 

  8. Benenson, Y., Paz-Elizur, T., Adar, R., Keinan, E., Livneh, Z., Shapiro, E.: Programmable and autonomous computing machine made of biomolecules. Nature, 414, 430–434 (2001)

    Article  Google Scholar 

  9. Gheorghe, P., Grzegorz, R., Arto, S.: DNA Computing. New Computing Paradigms, Springer-Verlag (1998)

    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

Qu, H., Zhu, H. (2005). DNA-based Parallel Computation of Addition. In: Zhang, W., Tong, W., Chen, Z., Glowinski, R. (eds) Current Trends in High Performance Computing and Its Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27912-1_55

Download citation

Publish with us

Policies and ethics