Bacterial Foraging Algorithm Based on Activity of Bacteria for DNA Computing Sequence Design
Open Access
- 25 December 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 2110-2124
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.Keywords
Funding Information
- National Natural Science Foundation of China (62072067, 61602080, 61761136019, 61872436, 61601080, 61602084, 61772112)
- National Key Research and Development Program of China (2017YFC0704200)
- China Postdoctoral Science Foundation (2018T110221, 2016M591431)
- Social Science Foundation of Liaoning Province (L17CTQ002)
- Natural Science Foundation of Liaoning Province (20180550540)
- Fundamental Research Funds for the Central Universities (DUT18RC(4)008)
This publication has 48 references indexed in Scilit:
- Towards practical, high-capacity, low-maintenance information storage in synthesized DNANature, 2013
- Multiplexed Aptasensors and Amplified DNA Sensors Using Functionalized Graphene Oxide: Application for Logic Gate OperationsACS Nano, 2012
- Neural network computation with DNA strand displacement cascadesNature, 2011
- Making sense of it all: bacterial chemotaxisNature Reviews Molecular Cell Biology, 2004
- Comparison of different melting temperature calculation methods for short DNA sequencesBioinformatics, 2004
- The Thermodynamics of DNA Structural MotifsAnnual Review of Biophysics, 2004
- DNA Sequence Design Based on Template StrategyJournal of Chemical Information and Computer Sciences, 2003
- On Combinatorial DNA Word DesignJournal of Computational Biology, 2001
- Reliability and Efficiency of a DNA-Based ComputationPhysical Review Letters, 1998
- Molecular Computation of Solutions to Combinatorial ProblemsScience, 1994