Adleman-Lipton模型中最大K-列子图问题的分子解
Molecular solutions for the Maximum K-colourable Sub graph Problem in Adleman-Lipton model
摘要:
阿德勒曼表明,脱氧核糖核酸DNA链可以用来计算解决一个例子的哈密顿路径问题。Lipton还证明了Adleman技术可以用来解决可满足性问题。本文利用Adleman Lipton模型提出了一种求解最大k列子图问题的DNA算法。尽管最大k列子图问题是NP-困难的,我们的DNA程序是在多项式时间内完成的。
英文摘要:
Adleman showed that deoxyribonucleic acid DNA strands could be employed towards calculating solutions to an instance of the Hamiltonian path problem . Lipton also demonstrated that Adleman techniques could be used to solve the Satisfiability problem. In this paper, we use Adleman Lipton model for developing a DNA algorithm to solve Maximum k-colourable Sub graph problem. In spite of the NP-hardness of Maximum k-colourable Sub graph problem our DNA procedures is done in a polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。