| 注册
首页|期刊导航|湖南大学学报(自然科学版)|一种基于DNA自组装模型求解最大团问题的算法

一种基于DNA自组装模型求解最大团问题的算法

周炎涛 李肯立 罗兴 黎福海 朱青

湖南大学学报(自然科学版)2012,Vol.39Issue(9):39-44,6.
湖南大学学报(自然科学版)2012,Vol.39Issue(9):39-44,6.

一种基于DNA自组装模型求解最大团问题的算法

An Algorithm for Solving Maximum Clique Problem Based on Self-Assembly Model of DNA

周炎涛 1李肯立 2罗兴 2黎福海 1朱青1

作者信息

  • 1. 湖南大学电气与信息工程学院,湖南长沙410082
  • 2. 湖南大学信息科学与工程学院,湖南长沙410082
  • 折叠

摘要

Abstract

On the basis of tiles theory model and the existing self-assembly model, an algorithm based on DNA self-assembly model was presented for maximum clique problem, and the corresponding DAE blocks designed in particular for initial molecular, rules of molecular and the detection of molecular were given. Then, an algorithm for solving maximum clique problem was presented with the biologic operation of fluorescence labeling and gel electrophoresis. The proposed algorithm needs Θ(n2 +|E|) types of tiles, and the complexity of experiment operation was Θ(1). This algorithm can reduce the complexity of the ex~ periment* and ensure the ease of experiment and the accuracy of results.

关键词

DNA序列/最大团问题/DNA自组装模型

Key words

DNA sequences/maximum clique problem/ DNA self-assembly model

分类

信息技术与安全科学

引用本文复制引用

周炎涛,李肯立,罗兴,黎福海,朱青..一种基于DNA自组装模型求解最大团问题的算法[J].湖南大学学报(自然科学版),2012,39(9):39-44,6.

基金项目

国家自然科学基金资助项目(61173013) (61173013)

湖南大学学报(自然科学版)

OA北大核心CSCDCSTPCD

1674-2974

访问量0
|
下载量0
段落导航相关论文