摘要
运用DNA计算模式中基于粘贴运算的粘贴模型求解最小集合覆盖问题.在粘贴模型中,用存储复合体来表示子集,并利用粘贴运算的巨大并行性,可以有效地求解最小集合覆盖问题.举例说明了基于DNA粘贴模型求解最小集合覆盖问题的过程.
In order to resolve the minimal set covering problem availably, the sticker model of DNA computation based on sticking operations is introduced. With the aid of sticker model, the minimal set covering problem can be solved by transforming the subset to memory complex and utilizing the massive parallelism of sticking operations. An example is given to explain the algorithm in detail.
出处
《上海理工大学学报》
EI
CAS
北大核心
2008年第1期41-44,49,共5页
Journal of University of Shanghai For Science and Technology
基金
上海市重点学科建设资助项目(T0502)
