DNA Computing with Water Strider Based Vector Quantization for Data Storage Systems

The exponential growth of data necessitates an effective data storage scheme,which helps to effectively manage the large quantity of data.To accomplish this,Deoxyribonucleic Acid(DNA)digital data storage process can be employed,which encodes and decodes binary data to and from synthesized strands of DNA.Vector quantization(VQ)is a commonly employed scheme for image compression and the optimal codebook generation is an effective process to reach maximum compression efficiency.This article introduces a newDNAComputingwithWater StriderAlgorithm based Vector Quantization(DNAC-WSAVQ)technique for Data Storage Systems.The proposed DNAC-WSAVQ technique enables encoding data using DNA computing and then compresses it for effective data storage.Besides,the DNAC-WSAVQ model initially performsDNA encoding on the input images to generate a binary encoded form.In addition,aWater Strider algorithm with Linde-Buzo-Gray(WSA-LBG)model is applied for the compression process and thereby storage area can be considerably minimized.In order to generate optimal codebook for LBG,the WSA is applied to it.The performance validation of the DNAC-WSAVQ model is carried out and the results are inspected under several measures.The comparative study highlighted the improved outcomes of the DNAC-WSAVQ model over the existing methods.

Closed circle DNA algorithm of change positive-weighted Hamilton circuit problem

Chain length of closed circle DNA is equal. The same closed circle DNA＇s position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so closed circle DNA computing model is generalized. For change positive-weighted Hamilton circuit problem, closed circle DNA algorithm is put forward. First, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions are composed. Then, the feasible solutions are filtered out by using group detect experiment, and the optimization solutions are obtained by using group insert experiment and electrophoresis experiment. Finally, all optimization solutions are found by using detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Three dominances of the closed circle DNA algorithm are analyzed, and characteristics and dominances of group delete experiment are discussed.

SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING

Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a fixed code length. According to the characteristics of the problem, a DNA algorithm solving the minimum spanning tree problem is given. The effectiveness of the proposed method is verified by simulation. The advantages and disadvantages of this algorithm are discussed.

Color image encryption algorithm based on chaotic mapping and DNA encoding

A color image encryption method combining deoxyribonucleic(DNA)encoding and hyperchaotic mapping is proposed to solve the problems of simple structure,low complexit and low security of the existing encryption system for low-dimensional chaotic mapping encoding system and a single DNA encoding system.Firstly,according to the information of the plaintext images,the initial values of all chaotic maps and the random matrices with the same size as the plaintext images are iteratively generated.Then,the generated initial values and random matrices are divided into the sub-blocks with the same size.The DNA encoding mode of each sub-block and the DNA operation rules between the sub-blocks are determined by the dynamic hyperchaotic sequence.Finally,the diffusion operation is adopted to achieve a better encryption effect.The simulation results indicate that the proposed encryption algorithm can resist a variety of attacks due to its high complexity,strong security and large key space.

Job shop scheduling problem based on DNA computing

To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, optimum solutions are obtained by sequencing A small job shop scheduling problem is solved in DNA computing, and the ＂operations＂ of the computation were performed with standard protocols, as ligation, synthesis, electrophoresis etc. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.

Hamilton Graph Based on DNA Computing

DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. Hamilton Graph Problem has been solved by means of molecular biology techniques. A small graph was encoded in molecules of DNA, and the 'operations' of the computation were performed with standard protocols and enzymes. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.

THE MOLECULAR ALGORITHM OF CONNECTIVITY BASED ON THREE DIMENSIONAL DNA STRUCTURE

Inspired by the potential computational capability of 3-Dimensional (3D) DNA structure,this paper presents a graph structure constructed by k-armed (k = 3or 4) branched junction DNA molecules to explore the possibility of solving some intractable problems. In the proposed procedure,vertex building blocks consisting of 3,4-armed branched junction molecules are selectively used to form different graph structures. After separating these graph structures by gel electrophoresis,the connec-tivity of this graph can be determined. Furthermore,the amount of potential solutions can be reduced by a theorem of graph theory.

Quantum demonstration of a bio-molecular solution of the satisfiability problem on spin-based ensemble

DNA computation （DNAC） has been proposed to solve the satisfiability （SAT） problem due to operations in parallel on extremely large numbers of strands. This paper attempts to treat the DNA-based bio-molecular solution for the SAT problem from the quantum mechanical perspective with a purpose to explore the relationship between DNAC and quantum computation （QC）. To achieve this goal, it first builds up the correspondence of operations between QC and DNAC. Then it gives an example for the case of two variables and three clauses for details of this theory. It also demonstrates a three-qubit experiment for solving the simplest SAT problem with a single variable on a liquid-state nuclear magnetic resonance ensemble to verify this theory. Some discussions are made for the potential application and for further exploration of the present work.

Amino Acid Encryption Method Using Genetic Algorithm for Key Generation

In this new information era,the transfer of data and information has become a very important matter.Transferred data must be kept secured from unauthorized persons using cryptography.The science of cryptography depends not only on complex mathematical models but also on encryption keys.Amino acid encryption is a promising model for data security.In this paper,we propose an amino acid encryption model with two encryption keys.The first key is generated randomly using the genetic algorithm.The second key is called the protein key which is generated from converting DNA to a protein message.Then,the protein message and the first key are used in the modified Playfair matrix to generate the cypher message.The experimental results show that the proposed model survives against known attacks such as the Brute-force attack and the Ciphertext-only attack.In addition,the proposed model has been tested over different types of characters including white spaces and special characters,as all the data is encoded to 8-bit binary.The performance of the proposed model is compared with other models using encryption time and decryption time.The model also balances all three principles in the CIA triad.

Minimizing of the only-insertion insdel systems

A more recent branch of natural computing is DNA computing. At the theoretical level, DNA computing is powerful. This is due to the fact that DNA structure and processing suggest a series of new data structures and operations, and to the fact of the massive parallelism. The insertion-deletion system （insdel system） is a DNA computing model based on two genetic operations： insertion and deletion which, working together, are very powerful, leading to characterizations of recursively enumerable lan- guages. When designing an insdel computer, it is natural to try to keep the underlying model as simple as possible. One idea is to use either only insertion operations or only deletion operations. By helping with a weak coding and a morphism, the family INS4^7DEL0^0 is equal to the family of recursively enumerable languages. It is an open problem proposed by Martin-Vide et al. on whether or not the parameters 4 and 7 appearing here can be replaced by smaller numbers. In this paper, our positive answer to this question is that INS2^4DEL0^0 can also play the same role as insertion and deletion. We suppose that the INS2^4DEL0^0 may be the least only-insertion insdel system in this situation. We will give some reasons supporting this conjecture in our paper.

Solving the maximal matching problem with DNA molecules in Adleman-Lipton model

The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid （DNA） molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O（n^3） time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.

Symmetric-key cryptosystem with DNA technology

DNA cryptography is a new field which has emerged with progress in the research of DNA computing. In our study, a symmetric-key cryptosystem was designed by applying a modern DNA biotechnology, microarray, into cryptographic technologies. This is referred to as DNA symmetric-key cryptosystem (DNASC). In DNASC, both encryption and decryption keys are formed by DNA probes, while its ciphertext is embedded in a specially designed DNA chip (microarray). The security of this system is mainly rooted in difficult biology processes and problems, rather than conventional computing technology, thus it is unaffected by changes from the attack of the coming quantum computer. The encryption process is a fabrication of a specially designed DNA chip and the decryption process is the DNA hybridization. In DNASC, billions of DNA probes are hybridized and identified at the same time, thus the decryption process is conducted in a massive, parallel way. The great potential in vast parallelism computation and the extraordinary information density of DNA are displayed in DNASC to some degree.

DNA labelled graphs with DNA computing

Let k ? 2, 1 ? i ? k and α ? 1 be three integers. For any multiset which consists of some k-long oligonucleotides, a DNA labelled graph is defined as follows: each oligonucleotide from the multiset becomes a point; two points are connected by an arc from the first point to the second one if the i rightmost nucleotides of the first point overlap with the i leftmost nucleotides of the second one. We say that a directed graph D can be (k, i; α)-labelled if it is possible to assign a label (l 1(x), ..., l k (x)) to each point x of D such that l j (x) ? {0, ..., α ? 1} for any j ? {1, ..., k} and (x, y) ? E(D) if and only if (l k?i+1(x), ..., l k (x)) = (l 1(y), ..., l i (y)). By the biological background, a directed graph is a DNA labelled graph if there exist two integers k, i such that it is (k, i; 4)-labelled. In this paper, a detailed discussion of DNA labelled graphs is given. Firstly, we study the relationship between DNA labelled graphs and some existing directed graph classes. Secondly, it is shown that for any DNA labelled graph, there exists a positive integer i such that it is (2i, i; 4)-labelled. Furthermore, the smallest i is determined, and a polynomial-time algorithm is introduced to give a (2i, i; 4)-labelling for a given DNA labelled graph. Finally, a DNA algorithm is given to find all paths from one given point to another in a (2i, i; 4)-labelled directed graph.

Development of DNA computing and information processing based on DNA-strand displacement

DNA computing, currently a hot research field in information processing, has the advantages of parallelism, low energy consumption, and high storability, therefore, it has been applied to a variety of complicated computational problems. The emerging field of DNA nanotechnology has also developed quickly; within it, the method of DNA strand displacement has drawn great attention because it is self-induced, sensitive, accurate, and operationally simple. This article summarizes five aspects of the recent developments of DNA-strand displacement in DNA computing:(1) cascading circuits;(2) catalyzed reaction;(3) logic computation;(4) DNA computing on surfaces; and(5) logic computing based on nanoparticles guided by strand displacement. The applications and mechanisms of strand displacement in DNA computing are discussed and possible future developments are presented.

Logic-Gated Plasmonic Nanodevices Based on DNA-Templated Assembly

Life has evolved numerous elegant molecular machines that recognize biological signals and affect mechanical changes precisely to achieve specific and versatile biofunctions.Inspired by nature,synthetic molecular machines could be designed rationally to realize nanomechanical operations and autonomous computing.We constructed logic-gated plasmonic nanodevices through coassembly of two gold nanorods(AuNRs)and computing elements on a tweezer-shaped DNA origami template.After recognition of various molecular inputs,such as DNA strands,glutathione,or adenosine,the geometry and plasmonic circular dichroism(CD)signals of the AuNR–origami nanodevices produced corresponding changes.Then we designed and characterized a set of modular Boolean logic-gated nanodevices(YES,NOT,AND,OR)and proceeded to construct a complicated 3-input circuit capable of performing Boolean OR-NOT-AND operations.Our plasmonic logic devices transduced external inputs into conformational changes and near-infrared(NIR)chiral outputs.This DNA-based self-assembly strategy holds great potential for applications in programmable optical modulators,molecular information processing,and bioanalysis.

Aqueous COmputing：A Survey with an Invitation to Participate

The concept of aqueous computing is presented here, first in full generality,and afterward, using an implementation in a specific enzymatic technology. Aqueous computing arosein the context of biomolecular (DNA) computing, but the concept is independent of the specifics ofits biochemical origin. Alternate technologies for realizing aqueous computing are being consideredfor future implementation. A solution of an instance of the Boolean satisfiability problem, (SAT),is reported here that provides a new example of an aqueous computation that has been carried outsuccessfully. This small instance of the SAT problem is sufficiently complex to allow our currentenzymatic technology to be illustrated in detail. The reader is invited to participate in the richinterdisciplinary activity required by wet lab computing. A project is suggested to the reader fordetermining the three-colorings of a graph. The basic operations required for this project areexhibited in the solution of the SAT example reported here.

Memory and machine attributes-based profiling and elliptic curve cryptography-based multi-level authentication for the security of Internet of Things

Purpose-Due to the connectivity of the multiple devices and the systems on the same network,rapid development has become possible in Internet of Things(IoTs)for the last decade.But,IoT is mostly affected with severe security challenges due to the potential vulnerabilities happened through the multiple connectivity of sensors,devices and system.In order to handle the security challenges,literature presents a handful of security protocols for IoT.The purpose of this paper is to present a threat profiling and elliptic curve cryptography(ECC)-based mutual and multi-level authentication for the security of IoTs.This work contains two security attributes like memory and machine-related attributes for maintaining the profile table.Also,the profile table stores the value after encrypting the value with ECC to avoid storage resilience using the proposed protocol.Furthermore,three entities like,IoT device,server and authorization centre(AC)performs the verification based on seven levels mutually to provide the resilience against most of the widely accepted attacks.Finally,DPWSim is utilized for simulation of IoT and verification of proposed protocol to show that the protocol is secure against passive and active attacks.Design/methodology/approach-In this work,the authors have presented a threat profiling and ECC-based mutual and multi-level authentication for the security of IoTs.This work contains two security attributes like memory and machine-related attributes for maintaining the profile table.Also,the profile table stores the value after encrypting the value with ECC to avoid storage resilience using the proposed protocol.Furthermore,three entities like,IoT device,server and AC performs the verification based on seven levels mutually to provide the resilience against most of the widely accepted attacks.Findings-DPWSim is utilized for simulation of IoT and verification of the proposed protocol to show that this protocol is secure against passive and active attacks.Also,attack analysis is carried out to prove the robustness of the proposed protocol against the password guessing attack,impersonation attack,server spoofing attack,stolen verifier attack and reply attack.Originality/value-This paper presents a threat profiling and ECC-based mutual and multi-level authentication for the security of IoTs.

Wavelet transform-based steganographic method for secure data communication using OFDM system

Purpose–Fueled by the rapid growth of internet,steganography has emerged as one of the promising techniques in the communication system to obscure the data.Steganography is defined as the process of concealing the data or message within media files without affecting the perception of the image.Media files,like audio,video,image,etc.,are utilized to embed the message.Nowadays,steganography is also used to transmit the medical information or diagnostic reports.The paper aims to discuss these issues.Design/methodology/approach–In this paper,the novel wavelet transform-based steganographic method is proposed for secure data communication using OFDM system.The embedding and extraction process in the proposed steganography method exploits the wavelet transform.Initially,the cost matrix is estimated by the following three aspects:pixel intensity,edge transformation and wavelet transform.The cost estimation matrix provides the location of the cover image where the message is to be entrenched.Then,the wavelet transform is utilized to embed the message into the cover image according to the cost value.Subsequently,in the extraction process,the wavelet transform is applied to the embedded image to retrieve the message efficiently.Finally,in order to transfer the secret information over the channel,the newly developed wavelet-based steganographic method is employed for the OFDM system.Findings–The experimental results are evaluated and performance is analyzed using PSNR and MSE parameters and then compared with existing systems.Thus,the outcome of our wavelet transform steganographic method achieves the PSNR of 71.5 dB which ensures the high imperceptibility of the image.Then,the outcome of the OFDM-based proposed steganographic method attains the higher PSNR of 71.07 dB that proves the confidentiality of the message.Originality/value–In the authors’previous work,the embedding and extraction process was done based on the cost estimation matrix.To enhance the security throughout the communication system,the novel wavelet-based embedding and extraction process is applied to the OFDM system in this paper.The idea behind this method is to attain a higher imperceptibility and robustness of the image.