Membrane computing with transport and embedded proteins. (English) Zbl 1158.68010
Summary: We look at the expressive power of P systems with proteins embedded on the membranes. The rules governing the evolution of the embedded proteins are inspired from brane calculi. We use some basic operations of brane calculi, namely, exo, endo, bud, mate, pino, wrap in the formalism of membrane computing. We also use rules allowing the movement of proteins, to pass through membranes and attach to and detach from the membranes. Combining the two kinds of operations, namely, brane calculi operations as well as protein movement operations, we have obtained some universality results of P systems. We have also identified some decidable sub-classes of P systems by restricting the use of the protein movement rules.
MSC:
| 68Q10 | Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) |
References:
| [1] | Busi, N.; Gorrieri, R., On the computational power of brane calculi, Transactions on Computational Systems Biology, 4, 16-43 (2006) |
| [2] | N. Busi, On the computational power of mate, bud, drip brane calculus: Interleaving Vs. Maximal parallelism, in: Proceedings of WMC6, 2005, pp. 235-252; N. Busi, On the computational power of mate, bud, drip brane calculus: Interleaving Vs. Maximal parallelism, in: Proceedings of WMC6, 2005, pp. 235-252 |
| [3] | Campbell, Neil; Reece, Jane B., Biology (2004), Addison-Wesley |
| [4] | L. Cardelli, Brane Calculi, interactions of biological membranes, in: Proceedings of CMSB, 2004, pp. 257-278; L. Cardelli, Brane Calculi, interactions of biological membranes, in: Proceedings of CMSB, 2004, pp. 257-278 · Zbl 1088.68657 |
| [5] | Cardelli, L.; Păun, Gh., An universality result based on mate/drip operations, International Journal of Foundations of Computer Science, 17, 1, 49-68 (2006) · Zbl 1088.68055 |
| [6] | M. Cavaliere, S. Sedwards, Decision problems in membrane systems with peripheral proteins, transport and evolution, Technical Report 12/2006, Microsoft Research — University of Trento, Centre for Computational and Systems Biology; M. Cavaliere, S. Sedwards, Decision problems in membrane systems with peripheral proteins, transport and evolution, Technical Report 12/2006, Microsoft Research — University of Trento, Centre for Computational and Systems Biology · Zbl 1151.68014 |
| [7] | Dassow, J.; Păun, Gh., Regulated Rewriting in Formal Language Theory (1989), Springer |
| [8] | Dassow, J.; Păun, Gh.; Salomaa, A., Grammars with controlled derivations, (Handbook of Formal Languages, vol. 2 (1997), Springer), (Chapter 3) |
| [9] | R. Freund, Gh. Păun, On the number of non-terminals in graph-controlled, programmed, and matrix grammars, in: Proceedings of UMC, 2001, pp. 214-225; R. Freund, Gh. Păun, On the number of non-terminals in graph-controlled, programmed, and matrix grammars, in: Proceedings of UMC, 2001, pp. 214-225 · Zbl 0984.68091 |
| [10] | Harrison, M., Introduction to Formal Language Theory (1978), Addison-Wesley · Zbl 0411.68058 |
| [11] | Krishna, S. N.; Păun, Gh., P Systems with mobile membranes, Natural Computing, 4, 3, 255-274 (2005) · Zbl 1092.68041 |
| [12] | Krishna, S. N., Universality results for P systems based on brane calculi operations, Theoretical Computer Science, 371, 1-2, 83-105 (2007) · Zbl 1108.68057 |
| [13] | Păun, A.; Popa, B., P systems with proteins on membranes, Fundamenta Informaticae, 72, 4, 467-483 (2006) · Zbl 1099.68031 |
| [14] | Păun, Gh., Computing with membranes, Journal of Computer and System Sciences, 61, 1, 108-143 (2000) · Zbl 0956.68055 |
| [15] | Păun, Gh., Membrane Computing. An Introduction (2002), Springer · Zbl 1034.68037 |
| [16] | Salomaa, A., Formal Languages (1973), Academic Press · Zbl 0262.68025 |
| [17] | Singer, S. G.; Nicolson, G. L., The fluid mosaic model of the structure of cell membranes, Science, 175, 720-731 (1972) |
| [18] | The membrane computing web page. http://psystems.disco.unimib.it; The membrane computing web page. http://psystems.disco.unimib.it |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
