Surface-based DNA algorithm for maximal matching problem

Tien Tzu Hsueh Pao/Acta Electronica Sinica

Volumn 31, Issue 10, 2003, Pages 1496-1499

  Liu, Wen Bin ^a,b   Gao, Lin ^c   Wang, Shu Dong ^a,b   Liu, Xiang Rong ^a   Xu, Jin ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b SHANDONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^c XIDIAN UNIVERSITY   (China)

Author keywords

DNA computing; Maximum matching problem; Surface based fashion

Indexed keywords

DNA; ENCODING (SYMBOLS);

DNA COMPUTING; MAXIMUM MATCHING PROBLEM; SURFACE BASED FASHION;

NATURAL SCIENCES COMPUTING;

EID: 1442351383     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. L Adleman. Molecular computation of solution to combinatorial problems[J]. Science, 1994, 266(11): 1021-1024.
2. R J Lipton. DNA solution of hard computational problems[J]. Science, 1995, 268(4): 542-545.
3. Q Ouyang, et al. DNA solution of the maximal clique problem[J]. Science, 1997, 278 (17): 446-449.
4. T Head, et al. Computing with DNA by operation on plasmids[J]. Biosystems 2000, 57: 87-93.
5. M Smith et al. A surface-based approach to DNA computation[J]. Journal of Computational biology, 1998, 5: 255-267.
6. Q Liu, et al. DNA computing on surfaces[J]. Nature, 2000, 403: 175-179.
7. H Wu. An improved surface-based method for DNA computation[J]. Boisystems, 2001, 59: 1-5.
8. J A Bondy, USR Murty. Graph Theory with Application[M]. the Macmillan Press LTD. London: Basingtoke and New York, 1976.