...
首页> 外文期刊>Journal of computational and theoretical nanoscience >A Molecular Computing Model for Maximum Clique Problem Based on DNA Nanoparticles
【24h】

A Molecular Computing Model for Maximum Clique Problem Based on DNA Nanoparticles

机译:基于DNA纳米粒子的最大派系问题分子计算模型

获取原文
获取原文并翻译 | 示例
           

摘要

In this article, the maximum clique problem is solved based on a computing model using DNA/AuNP (gold nanoparticle). In this model, the DNA probes are used to link the specific DNA/AuNP structures in order to generate initial solution space, then specific recognizing DNA/AuNP structures are used to delete the false solutions. Finally, the true solution can be separated by electrophoresis. Different from conventional algorithm, the algorithm in this paper has high efficiency as its low time and space complexity (both are O(2n+ m+ 2)). What's more, the biological operation is convenient and fast for it doesn't need any enzyme. Both the operations of eliminating false solutions and obtaining the optimum solution only need to be carried out once. This model presents a different method to solve similar problems.
机译:在本文中,基于使用DNA / AuNP(金纳米颗粒)的计算模型解决了最大派系问题。在此模型中,DNA探针用于连接特定的DNA / AuNP结构以生成初始溶液空间,然后使用特定的识别性DNA / AuNP结构删除假溶液。最后,真实溶液可以通过电泳分离。与传统算法不同,该算法具有较低的时间和空间复杂度(均为O(2n + m + 2)),具有较高的效率。此外,由于不需要任何酶,因此生物学操作方便快捷。消除错误解和获得最佳解的操作仅需要执行一次。该模型提出了解决相似问题的不同方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号