Principles of Biology in Service of Technology: DNA Computing

K. Aksa


Abstract: As commonly known that living beings cannot survive without natural sources available on earth, technology is no exception; it cannot develop without the inspiring help given by the same nature.

The field of biology has extensively participated in the computing field through the "code of life" DNA (Deoxyribo Nucleic Acid) since it was discovered by Adelman in the past century. This combination gave birth to DNA Computing, which is a very interesting new aspect of biochemistry. It works massively parallel with high energy efficiency, and requiring almost no space.

The field of molecular computing is still new and as the field progresses from concepts to engineering, researchers will address these important issues.

 By the use of encoding data into DNA strands, many NP-complete problems have been solved and many new efficient techniques have been proposed in cryptography field.

The aim of this paper is to give an overview of bio-inspired system and to summarize the great role of DNA molecule in servicing of the technology field.

Full Text:



Aksa, K.; Benmohammed, M. A comparison between geometric and bio-inspired algorithms for solving routing problem in wireless sensor network. International Journal of Networks and Communications 3 (2012) 27–32.

Bhateja, A.; Mittal K. DNA Steganography: Literature Survey on its Viability as a Novel Cryptosystem, Journal of Computer Science and Engineering Research 1(2015) 8-14.

Shimanovsky, B.; Feng, J; Potkonjak, M. Hiding data in DNA. In Information Hiding (2003) 373-386.

Clelland, C.; Risca, V.; Bancroft, C. Hiding messages in DNA microdots. Nature (1999) 533-534.

Heider, D.; Barnekow, A. DNA-based watermarks using the DNA-Crypt algorithm. BMC Bioinformatic Band 8 (2007) p. 176.

Boneh, D.; Dunworth, C.; Sgall, J. On the computational power of DNA. Discrete Applied Mathematics 71 (1996) 79-94.

Rooss, D.; Wagner, K. W. On the power of DNA-computers. Tech. Rep. 103, University of W. urzburg (1995).

Suresh Babu, E.; Naga Raju, C.; HM Krishna Prasad, M. Inspired Pseudo Biotic DNA Based Cryptographic Mechanism Against Adaptive Cryptographic Attacks. International Journal of Network Security 2 (2016) 291-303.

Dressler, F.; Akan, O. B. A Survey on Bio-inspired Networking. Computer Networks 6 (2010) 881-900.

Kranakis, E.; Singh, H.; Urrutia, J. Compass routing on geometric networks. Proc. 11th Canadian conference on computational geometry, Vancouver (1999).

Aksa, K. ; Batouche, M. Solving the Traveling Salesman Problem. Proc.COSI06, Algiers, Algeria (2006).

Adleman, L. M. On constructing a molecular computer, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society 27 (1996).

Wenbin, L.; Lin, G.; Qiang, Z.; Guandong, X.; Xiangou, Z. L.; Jin, X. Random Walk DNA Algorithm Xiangrong for the 3-SAT Problem. Current Nanoscience 1 (2005) 85-90.

Adleman, L. M. Molecular computation of solutions to combinatorial problems. Science 266 (1994)1021-1024.

Amos, M.; Gibbons, A.; Hodgson, D. Error-resistant implementation of DNA computations. Proc. Second Annual Meeting on DNA Based Computers, Princeton University (1996).

Ogihara, M. Ray A., Simulating Boolean circuits on a DNA computer. Tech. Rep.TR631, University of Rochester (1996).

Binitha, S.; Siva Sathya, S. A Survey of Bio inspired Optimization Algorithms. International Journal of Soft Computing and Engineering 2(2012).

Ahrabian, H.; Nowzari-Dalini, A. DNA Simulation of Nand Boolean Circuits. Advanced Modeling and Optimization 2 (2004).

Beigel, R.; Fu, B. Molecular computing, bounded nondeterminism, and efficient recursion. Proc. 24th International Colloquium on Automata, Languages, and Programming, no. 1256 in Lecture Notes in Computer Science (1997) 816-826.

Gloor, G.; Kari, L.; Gaasenbeek, M.; Yu, S.Towards a DNA solution to the Shortest Common Superstring Problem. Proc. IEEE'98 International Joint Symposia onIntelligence and Systems (1998)111-113,.

Kari, L.; Gloor, G.; Yu, S. Using DNA to solve the Bounded Post Correspondence Proble. Theoretical Computer Science 2 (2000) 193-203.

Amenyo, J. Mesoscopic computer engineering: Automating DNA-basedmolecular computing via traditional practices of parallel computer architecture design. Proc. Second Annual Meeting on DNA Based Computers (1996) 217-235.

Kang, N. A pseudo DNA cryptography Method, (2009).

Soni, R. Prajapati G., A Modern Review on DNA Cryptographic Techniques. International Journal of Advanced Research in Computer Science and Software Engineering 7 (2013) 162-167.

Aksa, K.; Batouche, M. New DNA Algorithm for K-Sat Problem. Proc. CIIA’06, Saida, Algeria (2006).

Lee, S. DWT based coding DNA watermarking for DNA copyright protection, Information Sciences, 273 (2014) 263–286.

Taur, J. S.; Lin, H. Y.; Lee, H. L.; Tao, C. W. Data Hiding In DNA Sequences Based On Table LookUp Substitution. International Journal of Innovative Computing, Information and Control 10 (2012).

Torkaman, M. R. N.; Kazazi, N. S.; Rouddini, A. Innovative approach to improve hybrid cryptography by using DNA steganography, International Journal of New Computer Architectures and their Applications 1 (2012) 224- 235.

Mitras, B. A.; Aboo, A. K. Proposed Steganography Approach Using Dna Properties, International Journal of Information Technology and Business Management 1 (2012).

Jacob, G.; Murugan, A. DNA based Cryptography: An Overview and Analysis. International Journal of Emerging Sciences 1 (2013) 36-27.

Suresh Babu, E.; Nagaraju, C.; Krishna, M. H. M. Prasad. Efficient DNA-Based Cryptographic Mechanism to Defend and Detect Black hole Attack in MANETs. Proc. International Conference on ICT for Sustainable Development, Vol. 408 of the series Advances in Intelligent Systems and Computing, (2016) 695-706.

Liu, H.; Lin, D.; Kadir, A. A novel data hiding method based on deoxyribonucleic acid coding. Computers& Electrical Engineering 4 (2013) 1164–1173.

Yunus, Y.; AbdRahman, S.; Ibrahim, J. Steganography: A Review of Information Security Research and Development in Muslim World.American Journal of Engineering Research 11 (2013) 122-128.

Gupta, K.; Singh, S. DNA based cryptographic techniques: a review. International Journal of Advanced Research in Computer Science and Software Engineering 3 (2013) 607-610.

Jain, S.; Chaudhary, H.; Bhatnagar, V.

An information security-based literature survey and classification framework of data storage in DNA. International Journal of Networking and Virtual Organisations 2 (2013) 176-201.

Lee, S. H. DNA sequence watermarking based on random circular angle. Digital Signal Processing 25 (2014) 173-189.

Vijayakumar, P.; Vijayalakshmi, V.; Zayaraz, G. An Improved Level of Security for DNA Steganography Using Hyperelliptic Curve Cryptography. Wireless Personal Communications 4 (2016) 1221–1242.

Lipton, R.J. DNA solution of hard computational problems. Science 268 (1995) 542-545.

Brach, R.; Chelyapov, N.; Johnson, C. P. Rothemund, L. Adleman, Solution of a 20 - variable 3 - sat problem on a DNA computer. Science 296 (2002) 499-502.

Peng, X.; Vadakkepat, P.; Heng Lee, T. DNA coded GA for the Rule Base Optimization of a Fuzzy Logic Controller. Proc. IEEE Congress of Evolutionary Computation (2001) 27-30.

Zinged, T. Formal Models of DNA Computing: A Survey. Proc. Estonian Acad. Sci. Phys. Math. 90–99, (2000).

Chang, W.; Guo, M. Solving the set cover problem and the problem of exact cover by 3-sets in the adleman-lipton model. BioSystems 72 (2003) 263–275.

Chang, W.; Ho, M.; Guo, M. Molecular solutions for the subset-sum problem on DNA-based supercomputing. Bio-Systems 73 (2004) 117–130.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License. Copyright UMMB © 2020 University M'hamed Bougara - Boumerdes. Independance AV., Boumerdes, 35000 Algeria, Tel/Fax: +213 24 91 14 98/ +213 2491-29-51