首页> 外文会议>International Conference on Bio-Inspired Computing >Plasmids DNA Computing Model for Satisfiability Problem
【24h】

Plasmids DNA Computing Model for Satisfiability Problem

机译:质粒DNA计算模型可满足性问题

获取原文

摘要

Plasmid is a free-floating, close circular DNA molecule in a bacterium, capable of making copies of itself in the host cell. It is often artificially constructed from natural plasmid and used in genetic engineering as cloning vector. The modified plasmid generally consists of replicon, selectable marker and cloning site. Plasmid DNA computing model was introduced by Head et al. in 2000. In their paper, vertices of undirected graph were represented by DNA segment inserted into computational plasmids,followed by a series of enzymatic modification, and finally the maximum independent set problem was solved. In 2002, Lin Gao et al. presented plasmid DNA computing model for the maxunum matching problem. In 2004, Run-nian Ma gave plasmid DNA computing model for the maximum weight clique problem.
机译:质粒是一种自由漂浮的封闭圆形DNA分子在细菌中,能够在宿主细胞中制备自身的副本。它通常由天然质粒人工构建,并用于克隆载体的基因工程。改性质粒通常由复制子,可选标记和克隆部位组成。通过Head等人引入质粒DNA计算模型。在2000年。在纸张中,未经向图的顶点由插入计算质粒的DNA段表示,然后是一系列酶改性,最后解决了最大独立的设定问题。 2002年,林高等人。呈现质粒DNA计算模型,用于MAXUNUM匹配问题。 2004年,Run-Nian MA为最大重量的Clique问题提供了质粒DNA计算模型。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号