Fast parallel DNA-based algorithms for molecular computation: The set-partition problem

IEEE Transactions on Nanobioscience

Volumn 6, Issue 4, 2007, Pages 346-353

  Chang, Weng Long ^a  

^a NATIONAL KAOHSIUNG UNIVERSITY OF APPLIED SCIENCES   (Taiwan)

Author keywords

DNA based computing; The NP complete problems; The NP hard problems

Indexed keywords

ADDERS; COMPUTATIONAL COMPLEXITY; DNA; MOLECULAR DYNAMICS; PROBLEM SOLVING; SET THEORY;

BIOLOGICAL OPERATIONS; DNA-BASED COMPUTING; MOLECULAR COMPUTATION; SET-PARTITION PROBLEMS;

ALGORITHMS;

DNA;

ALGORITHM; ARTICLE; DNA STRAND; GENE SEQUENCE; GENETIC MANIPULATION; MATHEMATICAL COMPUTING; MOLECULAR BIOLOGY; SEQUENCE ANALYSIS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; COMPUTERS, MOLECULAR; DNA; NUMERICAL ANALYSIS, COMPUTER-ASSISTED;

EID: 36749016340     PISSN: 15361241     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNB.2007.909012     Document Type: Article

References (13)

1. L. Adleman, "Molecular computation of solutions to combinatorial problems," Science, vol. 266, pp. 1021-1024, 1994.
2. W.-L. Chang, M. Guo, and M. Ho, "Fast parallel molecular algorithms for DNA-based computation: Factoring integers," IEEE Trans. Nanobiosci., vol. 4, no. 2, pp. 149-163, Jun. 2005.
3. 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.
4. W.-L. Chang and M. Guo, "Solving the set-cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model," BioSystems, vol. 72, no. 3, pp. 263-275, 2003.
5. G. Paun, G. Rozenberg, and A. Salomaa, DNA Computing: New Computing Paradigms. New York: Springer-Verlag, 1998.
6. L. M. Adleman, R. S. Braich, C. Johnson, P. W. K. Rothemund, D. Hwang, and N. Chelyapov, "Solution of a 20-variable 3-SAT problem on a DNA computer," Science, vol. 296, no. 5567, pp. 499-502, 2002.
7. M. Guo, W.-L. Chang, M. Ho, J. Lu, and J. Cao, "Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing," Biosystems, vol. 80, no. 1, pp. 71-82, 2005.
8. W.-L. Chang, M. Guo, and M. Ho, "Towards solution of the set-splitting problem on gel-based DNA computing," Future Gener. Comput. Syst., vol. 20, no. 5, pp. 875-885, Jun. 15, 2004.
9. 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.
10. W.-L. Chang, M. Ho, and M. Guo, "Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing," Parallel Comput., vol. 30, no. 9-10, pp. 1109-1125, 2004.
11. W.-L. Chang, M. Guo, and J. Wu, "Solving the independent-set problem in a DNA-based supercomputer model," Parallel Process. Lett., vol. 15, no. 4, pp. 469-480, Dec. 2005.
12. C.-W. Yeh, C.-P. Chu, and K.-R. Wu, "Molecular solutions to the binary integer programming problem based on DNA computation," Biosystems, vol. 83, no. 1, pp. 56-66, Jan. 2006.
13. A. Schuster, "DNAdatabases," BioSystems, vol. 81, pp. 234-246, 2005.