Improved volume molecular solutions for the maximum clique problem on DNA-based supercomputing

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 31, Issue 12, 2008, Pages 2173-2181

  Li, Ken Li ^a,b   Zhou, Xu ^a   Zou, Shu Ting ^a  

^a HUNAN UNIVERSITY   (China)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

DNA based supercomputing; Maximum clique problem; NP complete problem; Pruning strategy

Indexed keywords

COMPUTATIONAL COMPLEXITY; DNA;

BRUTE-FORCE SEARCHING; DNA-BASED SUPERCOMPUTING; MAXIMUM CLIQUE PROBLEMS; MOLECULAR ALGORITHM; MOLECULAR SOLUTIONS; PRUNING STRATEGY; SPACE EFFICIENT; TIME COMPLEXITY;

BIOINFORMATICS;

EID: 58149302300     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: 10.3724/sp.j.1016.2008.02173     Document Type: Article

References (19)

1. Sinden R R. DNA Structure and Function. New York: Academic Press, 1994
2. Adleman L M. Molecular computation of solutions to combinatorial problems. Science, 1994, 266: 1021-1024
3. Fu B, Beigel R. Length bounded molecular computing. BioSystems, 1999, 52: 155-163
4. Bach E, Condon A et al. DNA models and algorithms for NP-complete problems//Proceedings of the 11th Annual Conference on Structure in Complexity Theory. Antwerp, Belgium, 1996: 290-299
5. Fu B. Volume bounded molecular computation[Ph.D. dissertation]. Department of Computer Science, Yale University, New Haven, Connecticut, 1997
6. Bomze I M, Pelillo M et al. Approximating the maximum weight clique using replicator dynamics. IEEE Transactions on Neural Networks, 2000, 11(6): 1228-1241
7. Qu Hui-Qin, Lu Ming-Ming et al. Solve partition problem by sticker model in DNA computing. Progress in Nature Science, 2004, 14(12): 1116-1121
8. Chang W L, Guo M, Michael H. Fast parallel molecular algorithms for DNA-based computation: Factoring integer. IEEE Transactions on Nanobioscience, 2005, 4(2): 133-163
9. Zimmermann K H, Efficient DNA sticker algorithms for NP-complete graph problems. Computer Physics Communications, 2002, 144: 297-309
10. Xu J, Li S P et al. Sticker DNA computer model-Part I: Theory. Chinese Science Bulletin, 2004, 49(3): 205-212
11. Michael H, Chang W L et al. Fast parallel solution for set-packing and clique problems by DNA-based computing. IEICE Transactions on Information and System, 2004, E87-D(7): 1782-1788
12. Michael H. Fast parallel molecular solutions for DNA-based supercomputing: The subsetproduct problem. BioSystems, 2005, 80: 233-250
13. Quyang Q, Kaplan P D et al. DNA solution of the maximal clique problem. Science, 1997, 278: 446-449
14. Golumbic M C. Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press, 1980
15. Li Yuan et al. Genetic algorithm in DNA computing: A solution to the maximal clique problem. Chinese Science Bulletin, 2004, 49(9): 967-971(in Chinese)
16. Li K L, Yao F J et al. Improved molecular solutions for the knapsack problem on DNA-based supercomputing. Chinese Journal of Computer Research and Development, 2007, 44(6): 1063-1070
17. Lu S D. The Experimentation of Molecular Biology. Beijing: Peking Union Medical College Press, 1999
18. Li D F, Li X R et al. Scalability of the surface-based DNA algorithm for 3-SAT. BioSystems, 2006, 85: 95-98
19. Wang X L, Bao Z M et al. Solving the SAT problem using a DNA computing algorithm based on ligase chain reaction. BioSystems, 2008, 91: 17-125