Abstract

Since the quantity and quality of DNA sequence directly affect the accuracy and efficiency of computation, the design of DNA sequence is essential for DNA computing. In order to improve the efficiency and reliability of DNA computing, there is a rich literature targeting at generating DNA sequences with lower similarity that can hybridize at a lower melting temperature. However, it is not trivial to improve both melting temperature and similarity for the DNA sequence, since DNA sequence design problem under the constraints of Hamming distance, secondary structure and molecular thermodynamic is known to be NP-hard. For the sake of achieving the lower melting temperature and similarity for the generated DNA sequence, we proposed an improved method for the bacterial foraging algorithm based on activity of bacteria (BFA-A). In particular, the effect of bacterial vitality on foraging ability is considered, and a competitive exclusion mechanism is introduced to improve the quality of the generated DNA sequences. In BFA-A, high-quality DNA strands are replicated to avoid the participation of inferior strands in the operation, and the active regulation mechanism and the competitive rejection mechanism are used to improve and accelerate the chemotaxis process. Experiments show that our proposed approach significantly outperforms existing methods in terms of melting temperature and similarity. In addition, the experimental results also show that our method can reduce the number of iterations, and has guiding significance to generate high-quality DNA sequences more efficiency.

Highlights

  • DNA computing is one of novel computational models by combining computer science and biological science

  • In order to improve the problem of insufficient optimization of Sim and Hm in the BFA method, we propose the bacterial foraging algorithm based on activity of bacterial (BFA-A) by introducing activity regulation mechanism and competitive exclusion mechanism

  • In this paper, we proposed a DNA sequence coding method named BFA-A to generate DNA sequences with low mismatch probability and stable melting temperature, which solves the problem that DNA sequences are prone to mismatch and experimental temperature instability in DNA computing

Read more

Summary

INTRODUCTION

DNA computing is one of novel computational models by combining computer science and biological science. A large number of coding design methods based on heuristic algorithms are proposed by solving the formed multi-constraint optimization problem. All of the above methods can optimize the quality of the generated DNA sequences to a certain degree, but they are not capable of producing DNA sequences with sufficiently low Tm and Sim. In order to address this problem, we propose a DNA sequence design method based on the bacterial foraging algorithm (BFA). In order to improve the problem of insufficient optimization of Sim and Hm in the BFA method, we propose the bacterial foraging algorithm based on activity of bacterial (BFA-A) by introducing activity regulation mechanism and competitive exclusion mechanism These two mechanisms play a critical role in the process of chemotaxis to effectively reduce the melting temperature and similarity. BFA-A is composed by the four behaviors (i.e., initialization, chemotaxis, replication, and dispersion), which is an abstraction of the natural growth of bacterial colonies [45], [46]

OBJECTIVES
CONSTRAINTS
ALGORITHM DESIGN
SIMULATION RESULT
Findings
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call