H-ACO with Consecutive Bases Pairing Constraint for Designing DNA Sequences.

ABSTRACT

DNA computing is a novel computing method that does not rely on traditional computers. The design of DNA sequences is a crucial step in DNA computing, and the quality of the sequence design directly affects the results of DNA computing. In this paper, a new constraint called the consecutive base pairing constraint is proposed to limit specific base pairings in DNA sequence design. Additionally, to improve the efficiency and capability of DNA sequence design, the Hierarchy-ant colony (H-ACO) algorithm is introduced, which combines the features of multiple algorithms and optimizes discrete numerical calculations. Experimental results show that the H-ACO algorithm performs well in DNA sequence design. Finally, this paper compares a series of constraint values and NUPACK simulation data with previous design results, and the DNA sequence set designed in this paper has more advantages.