An Improved Iterated Hybrid Search for DNA Codes Design

DNA codes have a significant effect on the efficiency of DNA computing and other applications. Designing DNA codes is to obtain a certain sets of DNA codes with satisfying certain combinatorial constraints. Most works focus on algorithmic design for DNA codes. In this paper, Simulated Annealing and Clique Search are modified and combined into an iterated hybrid search to improve the lower bound for DNA codes set. Over 160 instances are considered, and the iterated hybrid search method is able to yield improvements for some lower bounds with n ≤ 16. Comparing with previous works, the proposed algorithm is more efficient for constructing DNA codes set.