In the algorithm,an idea that all maximum independent sets are formed straightway by deleting experiment is put forward and realized,that condition of maximum independent is satisfied gradually by doing time after time delete experiments.
在闭环DNA算法中,提出并实现了用删除实验直接构造所有最大独立集的构想,即通过多次删除实验使顶点集合逐步满足独立集的要求,最后达到最大独立集。
In the closed circle DNA algorithm,an idea that complementary sets of vertex covering are formed straightway by delete experiment is put forward and realized,which has design of the algorithm inimitable and novel.
在闭环DNA算法中,提出并实现了用删除实验直接构造顶点覆盖补集的构想;再通过电泳实验得到最小顶点覆盖的补集,由补集得到最小顶点覆盖。
To realize filtering algorithm of SAT problem using DNA computing model,the data structure of 2n dimension vector is adopted to do DNA encoding,which represents a valuation of SAT problem,and delete experiment of closed circle DNA computing model can just complete selection of initial valuations to obtain feasible solutions of SAT problem.
为了在DNA计算模型上实现可满足性问题过滤算法,采用2n维向量的数据结构进行DNA编码代表可满足性问题的赋值;而闭环DNA计算模型的删除实验恰好能够完成对初始赋值的筛选,得到可满足性问题的可行解。
It solved the problem of the conflict between teacher and grade and the problem of incorporate-class class by introducing group deleting experiment,solved the problem of normal incorporate-class class and problem of teacher s request of t.
本算法采用两部编码方式产生初始数据池,引入批删除实验解决了教师和班级的冲突问题和同班课问题;引入批分离实验解决了正常合班课问题和教师时间要求问题;引入电泳实验解决了排课的均衡分配问题;引入标记实验得到了排课表问题的全局最优解集,并给出了算法的生化实现过程。
