Improved molecular solutions for the N-QUEEN problem on DNA-based supercomputing

In this paper our main point is to give molecular solution to solve N-QUEEN problem. In order to achieve this, we take the divide and conquer strategy into the DNA-based supercomputing and propose DNA-based algorithm of an n-bit Parallel Searcher to formally verify our designed molecular solutions for the N-queen problem. The theoretical and experimental analysis shows that comparing with the exhaustive DNA-based algorithm for knapsack problem the algorithm not only shortened the length of the strands, but also reduced the DNA library strands from O(2^q) to O(2^q/2).