R.Freund, Gh.Paun, G.Rozenberg and A.Salomaa. Watson-Crick Automata. Proc. of 3rd DIMACS Workshop on DNA based computers, pp.305-317, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computation = Self-assembly + Conformational Change: Toward New.. - Yokomori (1999) (Correct)
....Computing is a novel computing paradigm recently emerged from and stimulated by a groundbreaking wet lab experimental work by Adleman in 1994. Since then, a great number of computation models have been proposed in the context of both biomolecular experiments and theoretical computer science (e.g. [2, 3, 7, 9, 10, 11, 13, 17, 19, 20]) trying to break through the so called NP completeness barrier or to establish new computation paradigms with universal capability. This paper proposes new computing paradigms based on self assembly and conformational change. These two principles have already appeared in an extensive variety of ....
....double stranded molecule. On the other hand, the structural simplicity of YAC computation assembly units is expected to facilitate its implementation greatly. From a computation theoretic point of view, the basic principle of YAC is quite similar to those of DNA EC( 20] and Watson Crick Automata ([7]) on one hand, and that of Winfree s 2D self assembly models ( 17, 18] on the other, while YAC model seems simple enough to be implemented with the state of the art technology of molecular biology. Finally, resource complexity issues in CCC may be one of the most major problems to be analysed, ....
R.Freund, Gh.Paun, G.Rozenberg and A.Salomaa. Watson-Crick Automata. Proc. of 3rd DIMACS Workshop on DNA based computers, pp.305-317, 1997.
YAC: Yet Another Computation Model of Self-Assembly - Yokomori (1999) (Correct)
....2 (n) Thus, we have: Proposition 5. Any language in NP can be recognized by YAC computation in polynommial time. 6. Conclusion From a computation theoretic point of view, the basic principle of computation in the YAC model is quite similar to those of DNA EC( 24] and Watson Crick Automata ([7]) in that DNA computational mechanism of these models is based on the task of equality checking of two working tapes of DNA strands, while we claim that YAC model is much simpler than others and it gains some advantages over them. On the other hand, there are already some results on self assembly ....
R.Freund, Gh.Paun, G.Rozenberg and A.Salomaa. Watson-Crick Automata. Proc. of 3rd DIMACS Workshop on DNA based computers, pp.305-317, 1997.
YAC: Yet Another Computation Model of Self-Assembly - Yokomori (1999) (Correct)
....of length of two strands is always bounded by O(P (jwj) during the computation. 7 Discussion 7. 1 Advantages of YAC Models From a computation theoretic point of view, the basic principle of computation in the YAC model is quite similar to those of DNA EC( 25] and Watson Crick Automata ([8]) in that DNA computational mechanism of these models is based on the task of equality checking of two working tapes of DNA strands, while we claim that YAC model is much simpler than others and it gains some advantages over them. On the other hand, there are already some results on self assembly ....
R.Freund, Gh.Paun, G.Rozenberg and A.Salomaa. Watson-Crick Automata. Proc. of 3rd DIMACS Workshop on DNA based computers, pp.305-317, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC