节点文献
求解0-1规划问题的DNA计算模型(英文)
A DNA Computation Model to Solve 0-1 Programming Problem
【摘要】 DNA计算是以DNA分子作为数据的一种新型计算模式.在DNA计算中首要面对的问题是编码问题.文中提出了一种双编码方法,利用这种编码方法可以使得在DNA计算的读解过程类似于DNA测序过程,容易实现自动化操作.基于该编码方法所建立的DNA计算模型可用于求解0-1规划问题,只需4次PCR反应即可读取问题的可行解.与其他DNA计算模型相比,该模型具有操作简单、易于实现的优点.
【Abstract】 DNA computing is a novel computation paradigm with DNA molecules as ’data’,and encoding is a crucial problem with great difficulties of DNA computing.In this paper,a novel encoding method named double encoding method is proposed,which could make the procedure of solution detection similar to DNA sequencing technology.By using this method a DNA algorithm to solve 0-1 programming problem is proposed and PCR is done only 4 times of to detect the feasible solutions.Compared with other DNA computing algorithms,this method could be easier and faster to read out the solution.
- 【文献出处】 计算机学报 ,Chinese Journal of Computers , 编辑部邮箱 ,2008年12期
- 【分类号】TP301.6
- 【被引频次】10
- 【下载频次】268