Graph multiset transformation: A new framework for massively parallel computation inspired by DNA computing

Natural Computing

Volumn 10, Issue 2, 2011, Pages 961-986

  Kreowski, Hans Jörg ^a   Kuske, Sabine ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

DNA computing; Graph multiset transformation; Massive parallelism; NP problems; Transformation units

Indexed keywords

DNA;

ALGORITHM; BIOINFORMATICS; CONFERENCE PAPER; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL;

EID: 79958053304     PISSN: 15677818     EISSN: 15729796     Source Type: Journal    
DOI: 10.1007/s11047-010-9245-6     Document Type: Conference Paper

References (16)

1. LM Adleman 1994 Molecular computation of solutions to combinatorial problems Science 266 1021 1024 10.1126/science.7973651 (Pubitemid 24373714)
2. Ehrig H, Ehrig K, Taentzer G, de Lara J, Varró D, Varró-Gyapai S (2005) Termination criteria for model transformation. In: Cerioli M (ed) Proceedings of fundamental approaches to software engineering (FASE 2005). Lecture notes in Computer science, vol 3442. Springer, Berlin, pp 49-63 (Pubitemid 41273670)
3. Fogel DB (2006) Evolutionary computation: toward a new philosophy of machine intelligence, 3rd edn. IEEE Press, Piscataway, NJ
4. Godard E, Métivier Y, Mosbah M, Sellami A (2002) Termination detection of distributed algorithms by graph relabelling systems. In: Corradini A, Ehrig H, Kreowski H-J, Rozenberg G (eds) Proceedings of the first international conference on graph transformation (ICGT '02). Lecture notes in Computer science, vol 2505. Springer, Berlin, pp 106-119
5. Goldberg DE (2002) The design of innovation: lessons from and for competent genetic algorithms. Addison-Wesley, Reading, MA
6. Habel A, Plump D (2001) Computational completeness of programming languages based on graph transformation. In: Honsell F, Miculan M (eds) Proceedings of foundations of software science and computation structures (FOSSACS 2001). Lecture Notes in Computer science, vol 2030. Springer, Berlin, pp 230-245 (Pubitemid 33254633)
7. Holland JM (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI
8. Kreowski H-J (2002) A sight-seeing tour of the computational landscape of graph transformation. In: Brauer W, Ehrig H, Karhumäki J, Salomaa A (eds) Formal and natural computing. Essays Dedicated to Grzegorz Rozenberg. Lecture notes in Computer science, vol 2300. Springer, Berlin, pp 119-137
9. Kreowski H-J, Kuske S (1999a) Graph transformation units and modules. In: Ehrig H, Engels G, Kreowski H-J, Rozenberg G (eds) Handbook of graph grammars and computing by graph transformation, vol 2: applications, languages and tools. World Scientific, Singapore, pp 607-638
10. H-J Kreowski S Kuske 1999 Graph transformation units with interleaving semantics Form Asp Comput 11 6 690 723 0966.68114 10.1007/s001659970005 (Pubitemid 129556010)
11. Kreowski H-J, Kuske S (2008) Graph multiset transformation as a framework for massively parallel computation. In: Proceedings of 4th international conference on graph transformations (ICGT 2008). Lecture notes in Computer science, vol 5214. Springer, Heidelberg, pp 351-365
12. H-J Kreowski S Kuske A Schürr 1997 Nested graph transformation units Int J Softw Eng Knowl Eng 7 4 479 502 10.1142/S0218194097000278 (Pubitemid 127663223)
13. Kuske S (2000) More about control conditions for transformation units. In: Ehrig H, Engels G, Kreowski H-J, Rozenberg G (eds) Proceedings of theory and application of graph transformations. Lecture notes in Computer science, vol 1764. Springer, Berlin, pp 323-337
14. Kuske S (2000) Transformation units-a structuring principle for graph transformation systems. PhD thesis, University of Bremen
15. Pǎun G, Rozenberg G, Salomaa A (1998) DNA computing-new computing paradigms. Springer, Berlin
16. D Plump 1998 Termination of graph rewriting is undecidable Fundam Inf 33 2 201 209 1654288 0903.68108 (Pubitemid 128434051)