Fast parallel solution for set-packing and clique problems by DNA-based computing

IEICE Transactions on Information and Systems

Volumn E87-D, Issue 7, 2004, Pages 1782-1788

  Ho, Michael ^a   Chang, Weng Long ^a   Guo, Minyi ^b   Yang, Laurence T ^c  

^a SOUTHERN TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b UNIVERSITY OF AIZU   (Japan)

^c ST FRANCIS XAVIER UNIVERSITY   (Canada)

Author keywords

Biological computing; DNA based computing; Molecular computing

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA PROCESSING; DNA; INFORMATION ANALYSIS; PROBLEM SOLVING; THEOREM PROVING;

BIOLOGICAL COMPUTING; DNA-BASED COMPUTING; LEGAL SOLUTIONS; MOLECULAR COMPUTING;

PARALLEL PROCESSING SYSTEMS;

EID: 3142666848     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (4)

1. W.-L. Chang and M. Guo, "Solving the set-cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton's model," BioSystems, vol.72, no.3, pp.263-275, 2003.
2. W.-L. Chang, M. Ho, and M. Guo, "Molecular solutions for the subset-sum problem on DNA-based supercomputing," BioSystems, vol.73, no.2, pp.117-130, 2004.
3. W.-L. Chang, M. Ho, and M. Guo, "Fast parallel molecular algorithms for DNA-based computation: Factoring integers," IEEE Fourth Symposium on Bioinformatics and Bioengineering (BIBE2004), pp.125-133, 2004, Taiwan, Republic of China.
4. L. Adleman, "Molecular computation of solutions to combinatorial problems," Science, vol.266, pp.1021-1024, Nov. 1994.