基于分子信标的全错位排列问题的DNA计算模型

A DNA Computing Method on the Molecular Beacon for Error Permutation Problems

全错位排列问题是组合数学的一个重要的问题,将问题转化成范式的形式,利用分子信标对满足性问题进行求解,给分子信标进行编码,对分子信标的识别区被其补链杂交时进行受力分析,设计分子信标的茎杆,当其识别区被其补链完全杂交时,茎杆被破坏打开并产生荧光,从而给出全错位排列问题的另一种DNA计算模型。

Error permutation problem is an important problem in combinatorial mathematics. In this paper, the problem was transformed into a normal form, and the SAT problem was solved by using molecular beacon. Code for molecular beacon, the analysis of the stress on the recognition region of molecular beacon was carried out by the complementary hybridization. The stem length of the molecular beacon was designed. When the identification area was complementary hybridization, the stems were broken and open with fluorescence, so as to give another DNA computing model for error permutation problems.