DocumentCode :
1936166
Title :
Closed Circle DNA Algorithm of the Maximal Matching Problem
Author :
Wang, Ming-chun ; Chen, Chao ; Xu, Rui-Lin
Author_Institution :
Tianjin Univ. of Technol. & Educ., Tianjin
Volume :
6
fYear :
2007
fDate :
19-22 Aug. 2007
Firstpage :
3326
Lastpage :
3330
Abstract :
This paper proposes a DNA algorithm based on the closed circle DNA for the maximal matching problem. First, the basic biochemistry experiments are given. Then, the matching problem is solved directly through a delete experiment. Lastly, the maximal matching is obtained through an electrophoresis experiment. Since only basic biochemistry experiments are utilized in the proposed algorithm, so the presented method is simple and credible.
Keywords :
biochemistry; biocomputing; computational complexity; pattern matching; DNA computing; NP-complete problem; basic biochemistry experiments; closed circle DNA algorithm; electrophoresis experiment; maximal matching problem; Biochemistry; Biological system modeling; Biology computing; Concrete; Cybernetics; DNA computing; Electrokinetics; Machine learning; Machine learning algorithms; Testing; Maximal matching; Model of closed circle DNA computing; NP¿complete problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2007 International Conference on
Conference_Location :
Hong Kong
Print_ISBN :
978-1-4244-0973-0
Electronic_ISBN :
978-1-4244-0973-0
Type :
conf
DOI :
10.1109/ICMLC.2007.4370722
Filename :
4370722
Link To Document :
بازگشت