A Surface-Based DNA Algorithm for Maximal Matching Problem

LIU Wen-bin; GAO Lin; WANG Shu-dong; LIU Xiang-rong; XU Jin

您当前的位置：

首页 >

文章列表页 >

A Surface-Based DNA Algorithm for Maximal Matching Problem

更新时间：2025-07-16

- A Surface-Based DNA Algorithm for Maximal Matching Problem
- Acta Electronica Sinica Vol. 31, Issue 10, Pages: 1496-1499(2003)
- 作者机构：
  
  1. 华中科技大学控制科学与工程系,湖北,武汉,430074
  2. 山东科技大学信息科学与工程学院,山东,泰安,271019
  3. 西安电子科技大学雷达信号处理国家重点实验室,陕西,西安,710071
  4. 华中科技大学控制科学与工程系湖北武汉,430074
  5. 山东科技大学信息科学与工程学院山东泰安,271019
  6. 西安电子科技大学雷达信号处理国家重点实验室陕西西安,710071
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP18
- Published Online：25 October 2003，
  
  Published：2003
- 稿件说明：
移动端阅览
LIU Wen-bin, GAO Lin, WANG Shu-dong, et al. A Surface-Based DNA Algorithm for Maximal Matching Problem[J]. Acta Electronica Sinica, 2003, 31(10): 1496-1499.
DOI：

LIU Wen-bin, GAO Lin, WANG Shu-dong, et al. A Surface-Based DNA Algorithm for Maximal Matching Problem[J]. Acta Electronica Sinica, 2003, 31(10): 1496-1499. DOI：

摘要

本文给出了一个最大匹配问题的DNA表面计算模型

我们在表面上逐步生成解空间的同时

利用酶切技术删除所产生的"不可行解"

从而大大减少了最终生成的解空间.最后

我们还研究了边的排列顺序对解空间的生成过程的影响.结果表明

通过对图中的边进行合理的编排也能减小不可行解的生成.

Abstract

This paper first proposes a DNA algorithm based on surface for the maximal matching problem.The main idea is to generate the possible solution space step by step in the solid surface

and at the same time these fault solutions are deleted through the digestion process of restriction enzymes.Finally the influence of the edge order on the solution generating process is discussed.Our results show that the solution space can be efficiently reduced by a reasonable arrangement of the order of edges.

关键词

Keywords

references

Views

1143

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Efficient Maximum Matching Problem Algorithms in the Tile Assembly Model

Improving the Single Template Method in DNA Computing

A New DNA Computing's Algorithm for 3-Dimensional Matching Problem Based on Divide and Conquer Strategy

Progress in the Research of DNA Computing

Analysis for Directed Hamilton Path Problems Based on Splicing Systems

Related Author

ZHOU Xu

ZHOU Yan-tao

LI Ken-li

OUYANG Ai-jia

PAN Guo

ZHANG Lin-xi

ZHU Xiang-ou

LIU Wen-bin

Related Institution

College of Electrical and Information Engineering Hunan University Changsha Hunan China

College of Information Science and Engineering Hunan University Changsha Hunan China

College of Mathematics and Information Engineering Jiaxing University Jiaxing Zhejiang China

College of Electrical and Information Engineering, Hunan University

College of Information Science and Engineering, Hunan University

⁰