Biological computation of the solution to the quadratic assignment problem

Applied Mathematics and Computation

Volumn 200, Issue 1, 2008, Pages 369-377

  Yang, Xiaofan ^a,b   Lu, Qing ^c   Li, Chuandong ^b   Liao, Xiaofeng ^b  

^a CHONGQING JIAOTONG UNIVERSITY   (China)

^b CHONGQING UNIVERSITY   (China)

^c Department of Chemistry   (China)

Author keywords

Adleman Lipton sticker model; Biological computing; DNA algorithm; NP hardness; Quadratic assignment problem

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS;

BIOLOGICAL COMPUTATION; DNA ALGORITHM; QUADRATIC ASSIGNMENT PROBLEM (QAP);

PROBLEM SOLVING;

EID: 43049181458     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2007.11.016     Document Type: Article

References (28)

1. Adleman L.M. Molecular computation of solutions to combinatorial problems. Science 266 (1994) 1021-1024
2. Adleman L.M., Rothemund P.W.K., Roweis S., and Winfree E. On applying molecular computation to the data encryption standard. Journal of Computational Biology 6 1 (1999) 53-63
3. Anstreicher K.M. Recent advances in the solution of quadratic assignment problems. Mathematical Programming Series B 97 (2003) 27-42
4. D. Boneh, R.J. Lipton, Making DNA computers error resistant, in: Proceedings of Second Annual DIMACS Conference on DNA Computing, 1996, pp. 102-110.
5. Chang W.-L., Guo M., and Ho M. Towards solution of the set-splitting problem on gel-based DNA computing. Future Generation Computer Systems 20 5 (2004) 875-885
6. Chang W.-L., Guo M., and Wu J. Solving the independent-set problem in a DNA-based supercomputer model. Parallel Processing Letters 15 4 (2005) 469-479
7. Commander C.W. A survey of the quadratic assignment problem with applications. Morehead Electronic Journal of Applicable Mathematics 4 (2005) 1-15
8. Faulhammer D., Cukras A.R., Lipton R.J., and Landweber L.F. Molecular computation: RNA solutions to chess problems. Proceedings of National Academy of Sciences 97 4 (2000) 1385-1389
9. Gaborit P., and King O.D. Linear constructions for DNA codes. Theoretical Computer Science 334 1-3 (2005) 99-113
10. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
11. Guo M., Ho M., and Chang W.-L. Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing. Parallel Computing 30 9-10 (2004) 1109-1125
12. Ho M. Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem. BioSystems 80 3 (2005) 233-250
13. R.M. Karp, C. Kenyon, O. Waarts, Error-resilient DNA computation, in: Proceedings of Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 458-467.
14. Koopman T.C., and Beckman M. Assignment problems and the location of economic activities. Econometric 25 (1957) 53-76
15. Lipton R.J. DNA solution of hard computational problems. Science 268 (1999) 542-545
16. Liu Q., Wang L., Frutos A.G., Condon A.E., Corn R.M., and Smith L.M. DNA computing on surfaces. Nature 403 (2000) 175-179
17. Marathe A., Condon A.E., and Corn R.M. On combinatorial DNA word design. Journal of Computational Biology 8 3 (2001) 201-220
18. Mao C., Labean T.H., Reif J.H., and Seeman N.C. Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407 (2000) 493-496
19. Ouyang Q., Kaplan P.D., Liu S., and Libchaber A. DNA solution of the maximal clique problem. Science 278 (1997) 446-449
20. Roweis S., Winfree E., Burgoyne R., Chelyapov N.V., Goodman M.F., Rothemund P.W.K., and Adleman L.M. A sticker based model for DNA computation. Journal of Computational Biology 5 4 (1998) 615-629
21. Sahni S., and Gonzalez T. P-complete approximation problems. Journal of the ACM 23 (1976) 555-565
22. Sakamoto K., Gouzu H., Komiya K., Kiga D., Yokoyama S., Yokomori T., and Hagiya M. Molecular computation by DNA hairpin formation. Science 288 (2000) 1223-1226
23. Shin S.-Y., Lee I.-H., Kim D., and Zhang B.-T. Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing. IEEE Transactions on Evolutionary Computation 9 2 (2005) 143-158
24. Smith L.M., Corn R.M., Condon A.E., Lagally M.G., Frutos A.G., Liu Q., and Thiel A.J. A surface-based approach to DNA computation. Journal of Computational Biology 5 2 (1998) 255-267
25. Wegener I. Complexity Theory (2005), Springer-Verlag, Berlin Heidelberg
26. Winfree E., Liu F., Wenzler L.A., and Seeman N.C. Design and assembly of two-dimensional DNA crystals. Nature 394 (1998) 539-544
27. Yang C.-N., and Yang C.-B. A DNA solution of SAT problem by a modified sticker model. BioSystems 81 1 (2005) 1-9
28. Yeh C.-W., Chu C.-P., and Wu K.-R. Molecular solutions to the binary integer programming problem based on DNA computation. BioSystems 83 1 (2006) 56-66