Chaotic System and DNA Computing operations for Image Encryption Based on Pixels Shuffling

Image encryption is one of the primary approaches which is used to keep image information secure and safe. Recently, image encryption is turning its attention to combination with the field of DNA computing. In the presented study, a novel method of image encryption is suggested and implemented based on the DNA algorithm and Chaos theory, the most important principle in image encryption is breaking the correlation amongst pixels. This algorithm performs well against chosen cipher-text attacks. Furthermore, the proposed approach was implemented and analyzed for the Number of Pixel Change Rate (NPCR), Unified Average Changing Intensity (UACI), The performance of the encryption method is analyzed using the histogram, Shannon entropy and key space.

A parallel biological computing algorithm to solve the vertex coloring problem with polynomial time complexity

The vertex coloring problem is a well-known combinatorial problem that requires each vertex to be assigned a corresponding color so that the colors on adjacent vertices are different, and the total number of colors used is minimized. It is a famous NP-hard problem in graph theory. As of now, there is no effective algorithm to solve it. As a kind of intelligent computing algorithm, DNA computing has the advantages of high parallelism and high storage density, so it is widely used in solving classical combinatorial optimization problems. In this paper, we propose a new DNA algorithm that uses DNA molecular operations to solve the vertex coloring problem. For a simple n-vertex graph and k different kinds of color, we appropriately use DNA strands to indicate edges and vertices. Through basic biochemical reaction operations, the solution to the problem is obtained in the O (kn2) time complexity. Our proposed DNA algorithm is a new attempt and application for solving Nondeterministic Polynomial (NP) problem, and it provides clear evidence for the ability of DNA calculations to perform such difficult computational problems in the future.

A Parallel Bioinspired Algorithm for Chinese Postman Problem Based on Molecular Computing

The Chinese postman problem is a classic resource allocation and scheduling problem, which has been widely used in practice. As a classical nondeterministic polynomial problem, finding its efficient algorithm has always been the research direction of scholars. In this paper, a new bioinspired algorithm is proposed to solve the Chinese postman problem based on molecular computation, which has the advantages of high computational efficiency, large storage capacity, and strong parallel computing ability. In the calculation, DNA chain is used to properly represent the vertex, edge, and corresponding weight, and then all possible path combinations are effectively generated through biochemical reactions. The feasible solution space is obtained by deleting the nonfeasible solution chains, and the optimal solution is solved by algorithm. Then the computational complexity and feasibility of the DNA algorithm are proved. By comparison, it is found that the computational complexity of the DNA algorithm is significantly better than that of previous algorithms. The correctness of the algorithm is verified by simulation experiments. With the maturity of biological operation technology, this algorithm has a broad application space in solving large-scale combinatorial optimization problems.

A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model

A DNA (DeoxyriboNucleic Acid) algorithm is proposed to solve the job shop scheduling problem. An encoding scheme for the problem is developed and DNA computing operations are proposed for the algorithm. After an initial solution is constructed, all possible solutions are generated. DNA computing operations are then used to find an optimal schedule. The DNA algorithm is proved to have an O(n2) complexity and the length of the final strand of the optimal schedule is within appropriate range. Experiment with 58 benchmark instances show that the proposed DNA algorithm outperforms other comparative heuristics.

DNA Epidemic Model Construction and Dynamics Optimization

In order to solve some complex optimization problems, the SIR-DNA algorithm was constructed based on the DNA-based SIR (susceptible-infectious-recovered) infectious disease model. Since infectious diseases attack a very small part of the individual's genes, the number of variables per treatment is small; thus, the natural dimensionality reduction of the algorithm is achieved. Based on the DNA-SIR infectious disease model, different infections can be distinguished in the pathogenesis of viruses. The mechanisms of disease transmission are described by the SIR model, and these are used to construct operators such as SS, SI, II, IR, RR, and RS, so that individuals can naturally exchange information naturally through disease transmission. The test results show that the algorithm has the characteristics of strong search ability and has a high convergence speed for solving complex optimization problems.