Abstract
We propose a (recursive) DNA algorithm for adding two binary numbers which require O(log n) bio-steps using only O(n) different type of DNA strands, where n is the size of the binary string representing the largest of the two numbers. The salient feature of our technique is that the input strands and the output strands have exactly the same structure which makes it fully procedural unlike most methods proposed so far. Logical operations of binary numbers can easily be performed by our method and hence can be used for cryptographic purpose.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Amos and P.E. Dunne, DNA Simulation of Boolean Circuits, Tech Report CTAG-97009, Dept of Computer Science, University of Liverpool, Dec 1997.
M. Amos, S. Wilson, D.A. Hodgson, G. Owenson and A. Gibbons, Practical Implementation of DNA Computation. In: Proc 1st International Conference of Unconventional Models of Computation, Aukland, N.Z., Jan 1998, pp 1–18.
Y. Aoi, T. Yoshinobu, K. Taniz awa, K. Kinoshita and H. Iwasaki, Ligation Errors in DNA Computing. In: Proc 4th DIMACS Workshop on DNA Based Computers, U Penn, 1998, pp 181–187.
A. Atanasiu, Arithmetic with Membrames. In: Proc of the Workshop on Mutiset Processing, Curtea de Arges, Romania, Aug 2000, pp 1–17.
S. Biswas, A Note on DNA Representation of Binary Strings. In: Computing with Bio-Molecules. Theory and Experiments, Ed G. Paun, 1998, pp 153–157.
D. Boneh, C. Dunworth, R. Lipton and J. Sgall, On Computational Power of DNA, Princeton CS Tech Report No. CSTR49995, 1995.
D. Boneh, C. Dunworth, J. Sgall and R. Lipton, Making DNA Computers Error Resistant. In: Proc 2nd DIMACS Workshop on DNA Based Computers, Princeton, 1996, pp 102–110.
K. Chen and E. Winfree, Error Correction in DNA Computing: Misclassification and Strand Loss. Proc of the 5th DIMACS Workshop on DNA Based Computers, MIT, Cambridge, 1999, pp 49–63.
P. Frisco, Parallel Arithmetic with Splicing. Romanian Journal of Information Science and Technology, 3, 2000, pp 113–128.
A. Gehani, T.H. LaBean and J.H. Reif, DNA-based Cryptography, In: Proc of the 5th DIMACS Workshop on DNA Based Computers, MIT, Cambridge, 1999.
F. Guarneiri, M. Fliss and C. Bancroft, Making DNA Add. Science 273, 1996, pp 220–223.
J.P. Hayes, Computer Architecture and Organization. McGraw-Hill International, Singapore, 2nd ed. 1988.
H. Hug and R. Schuler, DNA Based Parallel Computation of Simple Arithmetic. In: Proc of 7th DIMACS Workshop on DNA Based Computers, Tampa, 2001, pp 159–166.
V. Gupta, S. Parthasarathy and M.J. Zaki, Arithmetic and Logic Operations with DNA. In:Proc of 3rd DIMACS Workshop on DNA Based Computers, U Penn 1997, pp 212–220.
M. Ogihara and A. Ray, Simulating Boolean Circuits on a DNA Computer. Tech Report TR631, Department of C.Sc., University of Rochester, Aug 1996.
Z.F. Qiu and M. Lu, Arithmetic and Logic Operations with DNA Computers, Proc of 2nd IASTED International Conference on Parallel and Distributed Computing and Networks, Brisbane, 1998, pp 481–486.
D.R. Stinson, Crypytography: Theory and Practice, CRC Press, Boca Raton, 1995.
M. Yamamoto, J. Yamashita, T. Shiba, T. Hirayama, S. Takiya, K. Suzuki, M. Munekata and A. Ohuchi, A Study on the Hybridization Process in DNA Computing, In: Proc of the 5th DIMACS Workshop on DNA Based Computers, MIT, Cambridge, 1999, pp101–110.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barua, R., Misra, J. (2003). Binary Arithmetic for DNA Computers. 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_11
Download citation
DOI: https://doi.org/10.1007/3-540-36440-4_11
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