Author:
Bernardini Francesco,Brijder Robert,Cavaliere Matteo,Franco Giuditta,Hoogeboom Hendrik Jan,Rozenberg Grzegorz
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications
Reference34 articles.
1. Adleman LM (1994) Molecular computation of solutions to combinatiorial problems. Science 226:1021–1024
2. Adleman L, Cheng Q, Goel A, Huang MD (2001) Running time and program size complexity for self-assembled squares. In: Proceedings of the thirty-third ACM symposium on theory of computing. ACM Press, pp 740–748
3. Bernardini F, Gheorghe M (2004) Population P systems. J Univers Comput Sci 10(5):509–539
4. Bernardini F, Gheorghe M (2010) Tissue and population P systems. In: Păun et al. (2010), chapter 9, pp 227–250
5. Bernardini F, Gheorghe M, Krasnogor N, Giavitto JL (2005) On self-assembly in population P systems. In: Calude CS, Dinneen MJ, Păun Gh, Pérez-Jiménez MJ, Rozenberg G (eds) Uncoventional computation. 4th international conference, UC 2005, Sevilla, Spain, October 2005, Proceedings, vol 3365 of Lecture Notes in Computer Science. Springer, pp 46–57
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献