Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Acta Electronica Sinica》 2003-10
Add to Favorite Get Latest Update

A Surface-Based DNA Algorithm for Maximal Matching Problem

LIU Wen bin 1,2 ,GAO Lin 3,WANG Shu dong 1,2 ,LIU Xiang rong 1,XU Jin 1 (1.Department of Control Science and Engineering,Huazhong University of Science and Technology,Wuhan,Hubei 430074,China; 2.College of Information Science and Engineering,Shandong University of Science and Technology,Taian,Shandong 271019,China; 3.National Key Lab.of Radar Signal Processing,Xidian Univ.,Xi'an,Shanxi 710071,China)  
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.
【Fund】: 国家自然科学基金 (No .60 1 0 30 2 1 ;60 1 4 4 0 4 7)
【CateGory Index】: TP301
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved