A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem

BioSystems

Volumn 90, Issue 3, 2007, Pages 687-697

  García Arnau, Marc ^a   Manrique, Daniel ^a   Rodríguez Patón, Alfonso ^a   Sosík, Petr ^a,b  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b SILESIAN UNIVERSITY IN OPAVA   (Czech Republic)

Author keywords

Constructive approach; DNA computing; Maximum Clique Problem; Membrane computing; NP complete problem

Indexed keywords

DNA;

COMPARATIVE STUDY; DNA; GENETIC ALGORITHM; GENOMICS; GRAPHICAL METHOD; INHIBITOR;

ARTICLE; BIOLOGY; CALCULATION; COMPARATIVE STUDY; GENETIC ALGORITHM; GENOMICS; MATHEMATICAL COMPUTING; MEMBRANE; PARAMETER;

EID: 35649016677     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.biosystems.2007.02.005     Document Type: Article

References (31)

1. Adleman L.M. Molecular computation of solutions to combinatorial problems. Science 266 (1994) 1021-1024
2. Amos M., Gibbons A., and Hodgson D. Error-resistant implementation of DNA computations. Proceedings of the Second Annual Meeting on DNA Based Computers. Princeton University (1996) 87-101
3. Amos M. Theoretical and experimental DNA computation. Bull. Eur. Assoc. Theor. Comput. Sci. 67 (1999) 125-138
4. Bach E., Condon A., Glaser E., and Tanguay C. DNA models and algorithms for NP-complete problems. Proceedings of the 11th IEEE Conference on Computational Complexity (1996) 290-300
5. Bäck T., Kok J.N., and Rozenberg G. Evolutionary computation as a paradigm for DNA-based computing. In: Landweber L., Winfree E., Lipton R., and Freeland S. (Eds). Proceedings of the DIMACS Workshop on Evolution as Computation. Princeton, NJ (1999) 67-88
6. Baum E.B., and Boneh D. Running dynamic programming algorithms on a DNA computer. Proceedings of the Second Annual Meeting on DNA Based Computers. Princeton University (1996) 141-147
7. Benenson Y., Gil B., Ben-dor U., Adar R., and Shapiro E. An autonomous molecular computer for logical control of gene expression. Nature 429 (2004) 423-429
8. Bottoni P., Martin-Vide C., Pǎun G., and Rozenberg G. Membrane systems with promoters/inhibitors. Acta Inform. 38 (2002) 695-720
9. Butenko S., and Wilhelm W. Clique-detection Models in Computational Biochemistry and Genomics (2005), Department of Industrial Engineering Texas AM University, College Station, TX
10. Calude, C.S., Pǎun, G., 2004. Computing with Cells and Atoms: After Five Years. Centre for Discrete Mathematics and Theoretical Computer Science, CDMTCS-246 Research Report Series.
11. Chiu D.T., Pezzoli E., Wu H., Stroock A.D., and Whitesides G.M. Using three-dimensional microfluidic networks for solving computationally hard problems. Proc. Natl. Acad. Sci. U.S.A. 98 (2001) 2961-2966
12. Cukras A.R., Faulhammer D., Lipton R.J., and Landweber L.F. Chess games: a model for RNA based computation. Biosystems 52 (1999) 35-45
13. Garey M.R., and Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-completeness (1979), W.H. Freeman, San Francisco
14. Hagiya M. Perspectives on molecular computing. New Generat. Comput. 17 (1999) 131-151
15. Head T., Yamamura M., and Gal S. Aqueous computing: writing on molecules. Proceedings of Congress on Evolutionary Computation. IEEE Service Center, Piscataway, NJ (1999) 1006-1010
16. Ionescu M., and Sburlan D. On P systems with promoters/inhibitors. J. Univ. Comput. Sci. 10 (2004) 581-599
17. Krishna S.N., and Rama R. P systems with replicated rewriting. J. Automata, Lang. Comb. 6 (2001) 345-350
18. Ledesma L., Pazos J., and Rodríguez-Patón A. A DNA algorithm for the Hamiltonian Path Problem. Using microfluidic systems. Lecture Notes in Computer Science 2959 (2004), Springer-Verlag pp. 289-296
19. Ledesma L., Manrique D., and Rodriguez-Paton A. A tissue P system and a DNA microfluidic device for solving the shortest common superstring problem. Soft Comput. 9 (2005) 679-685
20. Lipton R.J. DNA solution of hard computational problems. Science 268 (1995) 542-545
21. Manca V., and Zandron C. A clause string DNA algorithm for SAT. Lecture Notes in Computer Science 2340 (2001), Springer-Verlag pp. 172-181
22. McCaskill J.S. Optically programming DNA computing in microflow reactors. Biosystems 59 (2001) 125-138
23. Ogihara, M., 1996. Breadth first search 3-SAT algorithms for DNA computers. Technical Report 629. University of Rochester, NY.
24. Ouyang Q., Kaplan, Peter D., Liu S., and Libchaber A. DNA solution of the maximal clique problem. Science 278 (1997) 446-449
25. Pǎun G. Biomolecular Computing. Theory and Experiment (1998), Springer-Verlag
26. Pǎun G. Computing with membranes. J. Comput. Syst. Sci. 61 (2000) 108-143
27. Pǎun G., Rozenberg G., and Salomaa A. DNA Computing. New Computing Paradigms (1998), Springer-Verlag
28. Pérez-Jiménez M.J., and Romero-Campero F.J. Attacking the common algorithmic problem by recognizer P systems. Lecture Notes in Computer Science 3354 (2005), Springer-Verlag pp. 304-315
29. Seelig G., Soloveichik D., Yu Zhang D., and Winfree E. Enzyme-free nucleic acid logic circuits. Science 314 (2006) 1585-1588
30. Zandron C., Ferretti C., and Mauri G. Solving NP complete problems using P systems with active membranes. In: Antoniou I., Calude C.S., and Dinneen M.J. (Eds). Unconventional Models of Computation (2000), Springer-Verlag, London 289-301
31. Zimmermann K.H. Efficient DNA sticker algorithms for NP-complete graph problems. Comput. Phys. Commun. 144 (2002) 297-309