图顶点着色问题的DNA计算模型

A DNA Computing Model for Graph Vertex Coloring Problem

DNA计算是以DNA分子作为数据的一种新型计算模式.为了减少DNA计算中编码的数量,不降低生化实验操作的可靠性,文中建立了一种基于酶切技术和PCR技术的图顶点着色DNA计算模型,给出了实现该模型的双编码的编码方案.分析表明,利用酶切技术和PCR技术能够有效删除非解并读取真解.该模型的解的检测方法类似于DNA测序技术,使得该模型更容易实现自动化操作.

DNA computing is a novel computation paradigm with DNA molecules as ＂data＂, and biochemistry trials as ＂information processing instruments＂. In this paper, a DNA computing model to solve graph vertex 3-coloring problem is proposed based on enzyme digestion reactions. The graph vertex coloring problem is encoded by double encoding method and the false solutions deletion and the true solutions detection are updated and automized partly after enzyme digestion reactions and polymerase chain reaction. This method could be easier and faster to read out the solution. Especially, the procedure of solution detection is similar to DNA sequencing technology.