One of the major hurdles that must be overcome in order for dna computing to become a tangible reality is the nondeterministic polynomial np optimization problem, a class of optimization for which no efficient algorithm has been developed. While performing the computing using dna, dna bases that make up the ground of the dna molecules are used. Dna computing based encryption and decryption algorithm. Dna computing, dna computation model, multiplication. Pdf analysing and obtaining the most efficient dna. Ibrahim computer science department, faculty of computers and informatics, benha university benha,egypt m. Dna computing a new technique for securing data using the biological structure of dna is called dna computing a. The dna computing based encryption and decryption algorithm. For example, a gram of dna contains about 1021 bases. Solving the satis ability problem with dna computing. Pdf adaptive dna computing algorithm by using pcr and. Solving twodimensional cutting stock problem via a dna. Dna computing algorithms have been developed are not sufficiently powerful and robust, however.
In this paper, a dna computing algorithm is proposed to find out the optimal solution of 01 knapsack. The goal of the dna computing field is to create a device that can work independent of human involvement. In dna computing, it is based on the computing techniques of dna, biochemistry and molecular biology, instead of traditional siliconbased computer technology. An efficient algorithm for multiplication based on dna computing 1 santosh kumar mishra, 2 sanchita paul 1 student m. A novel image encryption algorithm based on a fractionalorder hyperchaotic system and dna computing. Convolutional neural network cnn has gained stateoftheart results in many pattern recognition and computer vision tasks. In this type of computing, dna is used for encoding information and implementing computational algorithms by the use of chemical and biological operations. Dna deoxyribonucleic acid computing that is a new computation model based on dna molecules for information storage has been increasingly used for optimization and data analysis in recent years. Dna computing techniques might process in parallel for the population billion times larger than in conventional computers. Oct 25, 2018 in dna computing algorithm, we use short dna strands to represent layers and long dna strands to represent overall networks. In this paper, a dna computing algorithm based on the sticker model is presented to find the optimal solution to tdcsp. A symmetric encryption algorithm based on dna computing fatma e. Dna computing a computer that uses dna deoxyribonucleic acids to store information and perform complex calculations.
A symmetric encryption algorithm based on dna computing. Research and development in this area concerns theory, experiments, and applications of dna computing. It is proved that the time complexity of this algorithm on dna computers is polynomial considering the number of small pieces and the length and width of the main board. Dna computing is the use of biomolecular components rather than standard artificial hardware such as silicon chips in computer technology. Starting with the npproblem that adleman solved by means of wet dna experiment in 1994, dna becomes one of appropriate alternatives to overcome the silicon computer limitation. Structure learning of deep networks via dna computing algorithm. Generally, the computer systems are made up of siliconbased computer technologies. For example, dna polymerase will make a watsoncrick complemen tary dna strand fr om a dna template. Genetic algorithms, dna computing, and in vitro evolution are briefly discussed.
The adaptive algorithm is designed based on adlemanlipton paradigm3 of dna computing. Each operation on a test tube of dna is carried out on all strands in the tube in parallel. Dna cryptography can be defined as a hiding data in terms of dna sequence. Analyzing complexity for npcomplete problem through dna computing algorithm 11shalini rajawat, dr vijay singh rathore 2,naveen hemrajani,ekta menghani3 abstract adleman and lipton adopted a bruteforce search strategy to solve npcomplete problems by dna computing i. Solving the satis ability problem with dna computing cs245, logic and computation 9 22 the top 5 0. In this paper, a new approach for improvement of dna computing is proposed. Structure learning of deep networks via dna computing. In dna computing algorithm, we use short dna strands to represent layers and long dna strands to represent overall networks. Moussa computer science department, faculty of computers and informatics, benha university benha,egypt h. Researcharticle a novel image encryption algorithm based on a fractionalorder hyperchaotic system and dna computing taiyongli,1,2,3,4 minggaoyang,1 jiangwu,1. No power is required for dna computing while the computation is taking place. Implementation of evolutionary algorithms using dna computing. May 29, 2019 dna computing is the use of biomolecular components rather than standard artificial hardware such as silicon chips in computer technology. Before encryption starts, the encoding processes is carried out for plaintext to dna sequence conversion.
A new symmetric key dna cryptographic algorithm based on the dna key features and amino acid coding is proposed to enhance the security level of classical otp cipher 15. Salient features of dna dna replication replication is the method by which any molecule can form an exact replica of itself and the dna gets embedded in both these daughter molecules. The term molectronics has sometimes been used, but this term has already. Dna deoxyribose nucleic acid computing, also known as molecular computing is a new approach to massively parallel computation based on groundbreaking work by adleman. A novel dna computing based encryption and decryption. Dna computing is a new optimization algorithm performing computing using dna molecules which store genetic information of the living things. Dna computing, as will become apparent in the examples presented in this article. Pdf a symmetric encryption algorithm based on dna computing. Hence can store all the data in the world in a few milligrams. The library could be applied for integrated dna computing of twelvebit instances of npcomplete combinatorial problems by multistep dna selection in microflow reactors. In principle there could be billions upon trillions of dna molecules undergoing chemical reactions, that is, performing computations, simultaneously 3.
Knapsack problem is a classical npcomplete problem. Surprisingly, one gram of dna contains 1021 dna bases which is equivalent to 108 tb of data. Molecular computing is computation done at the molecular scale. It deals with the biochips made of dna that are able to perform billions of calculations at once by multiplying themselves in number. A new symmetric key dna cryptographic algorithm based on the dna key features and amino acid coding is proposed to enhance the security level of. In this paper, an algorithm is designed to simulate a plaintext encrypted by dna biotechnology and modern cryptography. For more molecular biology terminology and notions the reader is referred to kari 1997, watson et al. Dna extraction in this method, it is possible to separate and bring together different strands of dna that are of the same type. Mar 02, 2017 the concept of dna computing was first introduced in 1994. Qpsobased adaptive dna computing algorithm hindawi. A novel image encryption algorithm based on a fractional.
Towards evolutionary dna computing populations of trillions of candidates evaluated for fitness. A novel dna computing based encryption and decryption algorithm. Dna computing and its applications ieee conference. An algorithms input is therefore represented in the. Dna computing is a class of molecular computing that does computation by the use of reactions involving dna molecules. We found that most of the learned models perform similarly, and only those performing worse during the. The main benefit of using dna computers to solve complex problems is that different possible solutions are created all at once.
It was invented by leonard max adleman in the year 1994 for solving the complex problems such as the directed hamilton path problem and the npcomplete problem similar to the. A new encryption method based on rijndael algorithm and. Clearly, computing with dna has massive advantages over siliconbased machines. Dna computing was proposed as a means of solving a class of intractable computational problems in which the computing time can grow exponentially with problem size the np. A dna computing algorithm for solving the knapsack problem.
Thus improved dnabased computing methods for solving np optimization problems are needed in the art. Dna cryptography an area of dna computing bioinform proteom opn acc j dna cryptography an area of dna computing senapati kk department of computer science and engineering, birla institute of technology. Thus improved dna based computing methods for solving np optimization problems are needed in the art. Another drawback of his dna computer is that it requires human assistance. In dna computing, information is represented using the fourcharacter genetic alphabet a, g, c, and t, rather than the binary alphabet. Feb 25, 20 dna computing a computer that uses dna deoxyribonucleic acids to store information and perform complex calculations. A dna computer that can actually be reprogrammed wired. Dna computing has been by far the most successful in scale and complexity of the computations and molecular assemblies done of all. The concept of dna computing was first introduced in 1994.
Pdf recent advancements in dna computing computing. Basic computer science most of the existing models of dna computing have their formal basis in the theory of computing. The method is also applicable for the design of primers for pcr, dna sequences for isothermal amplification reactions, and capture probes in dnachip arrays. A dna computing algorithm based on a test message which was taken and then, it is. The dna computing based encoding algorithm the dna encoding algorithm has a welldefined process and explained in detail in17. A computation may be thought of as the execution of an algorithm, which itself may be defined as a stepbystep list of welldefined instructions that takes some input, processes it, and produces a result. I recently found a dna computing algorithm not genetic programming or genetic algorithms that attempts to find the hamiltonian path in a graph, but im a little confused by the pseudo code. Recently, rna computing has been developed based on dna computing. Dna is a polymer, which is strung together from monomers called deoxyribonucleotides.
Dna computing implementing genetic algorithms semantic scholar. In addition the most merit of this model is simple coding and its time efficiency. Analyzing complexity for npcomplete problem through dna. The adleman dna computer created a group of possible answers very quickly, but it took days for adleman to narrow down the possibilities. A dna is a molecule that plays the main role in dna based computing. A dna computing algorithm for directed hamiltonian paths. However, most of the cnn structures are manually designed by experienced researchers. Dna computers have to date only been able to run one algorithm, but a new design shows how these machines can be made more flexibleand useful. The application was realized by creating solution environment in the. Therefore many scientists try to combine dna computing with cryptography. Each deoxyribonucleotide containing three components. Using the proposed simulation system we are able to predict a scale.
The aim of this manuscript is to illustrate the current state of the art of dna computing achievements, especially of new approaches or methods contributing to solve either theoretical or application problems. Simple and effective algorithms are quested in order to bring dna computing on digital level and use it on large scale. Despite the complexity of this technology, the idea behind dna computing follows from a simple analogy between the following two processes, one. Whereas current technology rests on a highly linear principle of logic, and one computation must be completed before the next can begin, the use of dna means that an enormous number of calculations can take place simultaneously. Pdf one of the problems that have been solved by dna computing as a kind of biocomputing techniques is traveler salesman problem tsp which is a. However, dna computing algorithm has some limitations in terms of convergence speed, adaptability, and effectiveness. Dna computing has the high efficiency to solve some npproblems. Dna computing is a new field of research which performs computing using the biomolecular structure of dna molecules. In dna computing, information is represented using the fourcharacter genetic alphabet a, g, c, and t, rather than the binary alphabet 1. The existing models based on which a few dna computing algorithms were developed are not sufficiently powerful and robust to attract potential users. Dna computing, graph coloring, exponential solution space, adlemanlipton, npcomplete.
Adleman created the first computer to use dna to solve a problem. In this paper, we introduce an adaptive dna computing algorithm by using polymerase chain reaction pcr and restriction enzyme. This is achievable because short dna molecules of any arbitrary sequence may be synthesized to order. Dna computing is a branch of computing which uses dna, biochemistry, and molecular biology hardware, instead of the traditional siliconbased computer technologies. Lipton suggested that dna be replaced by rna in dna computing faulhammer et al.
The first study performed in the field of dna computing was the solution of the problem of traveling salesmen composed of 7 cities by adleman using real dna molecules. A genetic algorithm ga is a kind of soft computing with genetic mechanism. We found that most of the learned models perform similarly, and only those performing worse during the first runs of training will perform worse finally than others. Multiple dna crypto algorithms has been researched and published like the symmetric and asymmetric key crypto system using dna, dna steganography systems, triple stage dna cryptography, encryption algorithm inspired by dna and chaotic computing. Dna library design for molecular computation journal of. In dna computing, information is represented using the fourcharacter genetic alphabet a, g, c, and t, rather than the binary alphabet 1 and 0 used by traditional computers. Aes is one of the most widely used cryptographic systems. Pdf dna computing and its application researchgate. A recent example of this approach that avoids the generation of the full solution space is a solution to the sat problem using a dna computing algorithm based. Cukras, faulhammer, lipton, and landweber 1999 developed the theory of rna computing and proposed a destructive algorithm to solve the knight problem using only biological molecules and enzymes. Dna computing seminar ppt with pdf report there is a simple and elegant idea behind the dna computing.
Abdalkader information system department, faculty of computers and. In this paper, a new approach for improvement of dna. A clustering algorithm using dna computing based on three. In place of traditional code such as the common binary variety, dna computing utilizes the fourcharacter genetic alphabet, which consists of. In this paper, we design a computer simulation system that corresponds to a basic dna computing algorithm using list processing.
This paper presents two original dna cryptographic algorithms based on existing ideas described in related literature. Dna computing based rna genetic algorithm with applications. Implementation of evolutionary algorithms using dna. In fact, dna polymerase needs a star t 56 scientific american august 1998 computing with dna c onsider a map of cities connected by certain nonstop flights top right.
The proposed algorithm can be implemented on real biochemical reaction after simple transition, thus, the brute force method of dna computing can be broken. Encryption process the encryption algorithm comprises of the following steps for encrypting plaintext into cipher text. A new encryption method based on rijndael algorithm and dna. Dna deoxyribonucleic acid computing that is a new computation model based on dna molecules for information storage has been increasingly used for. For sake of brevity, the focus of this paper is retained on the encryption and decryption algorithm and not dealt in detail. Analyzing complexity for npcomplete problem through. The convergence analysis of the proposed algorithm shows that rnaga with elitist strategy can converge in probability to the global optimum.
213 1271 1090 393 584 1362 98 665 756 443 311 1318 1031 839 860 1374 692 293 891 653 366 15 936 897 787 250 10 709 1162 487 1471 606 921 1133 93 1258 627 368 1112 1335 382 1184 598 1440