An Improved Surface-based DNA Computing Model of Whole Error Permutation Problems

摘要

The whole error permutation problem is one of the most important questions in combinatorial mathematics. It was transformed into the SAT problem in previous surface-based computing models. Though surface-based model overcomes many shortcomings of the test tube fashion, the transformation has much limitation and it is hard to generalize an ecumenic conclusion from the models. The paper gives an improved surface-based DNA computing model, and with an artful encoding it not only inherits many advantages of surface-based model, but casts off many disadvantages of the previous model. At one time our design uses fluorescence hardening technology, it makes key ascertainment simple, effective and the algorithm is an effective method. At last the paper proposes the extending model to the partial error permutation problem through clever coding.