In DNA computing, the design of DNA code is the most important step. The definition of DNA code, the constraints of DNA encoding and the corresponding formula are firstly described in this article, and then the design of DNA encoding based on immune clone algorithm is introduced. Simulation experiments show that DNA molecular chains that satisfy specific constraints and the corresponding thermo...

String matching is considered as one of the center issues within field computer science, where there are numerous applications that supply clients with string services. The increment number databases which created and protected in gadgets had impacted researchers slant towards getting robust techniques tending to this issue. In study, Maximum-Shift algorithm chosen be executed multi-core innova...

The design of DNA sequences is critical for many research fields such as DNA self-assembly, DNA hybridization arrays, DNA computing, and PCR-based applications. DNA secondary structure prediction is the key part for these DNA nanotechnologies. In this paper, we present a dynamic programming algorithm to predict the secondary structure of single-stranded DNA tiles. The algorithm calculates all p...

Storage of sequence data is a big concern as the amount of data generated is exponential in nature at several locations. Therefore, there is a need to develop techniques to store data using compression algorithm. Here we describe optimal storage algorithm (OPTSDNA) for storing large amount of DNA sequences of varying length. This paper provides performance analysis of optimal storage algorithm ...

The research paper titled "Hybrid Data Encryption as well Decryption Using Hybrid RSA and DNA" develops a hybrid cryptosystem by combining the usefulness of such an asymmetric-key (public-key) with efficacy symmetric-key (private-key) cryptosystem. These two types cryptosystems use different keys. method addresses concerns regarding users' right to privacy, authentication, accuracy utilizing da...

Data compression is concerned with how information is organized in data. Efficient storage means removal of redundancy from the data being stored in the DNA molecule. Data compression algorithms remove redundancy and are used to understand biologically important molecules. We present a compression algorithm, "DNABIT Compress" for DNA sequences based on a novel algorithm of assigning binary bits...

In recent years, DNA-GA algorithm is drawing attention from scholars. The algorithm combines the DNA encoding and Genetic Algorithm, which solves the premature convergence of genetic algorithms, the weak local search capability and binary Hamming cliff problems effectively. How to design a more effective way to improve the performance of DNA-GA algorithm is more worth studying.As is known to al...

The potential of DNA as a truly parallel computing device is enormous. Solution-phase DNA chemistry, though not unlimited, provides the only currently-available experimental system. Its practical feasibility, however, is controversial. We have sought to extend the feasibility and generality of DNA computing by a novel application of the theory of counting . The biochemically equivalent operatio...