The role of integral membrane proteins in computational complexity theory

In the framework of Membrane Computing, several tools to tackle the P versus NP problems by means of frontiers of the efficiency expressed in terms of syntactic or semantic ingredients, have been developed. In this paper, an overview of the results in computational complexity theory concerning to membrane systems (tissue-like and cell-like approach) with symport/antiport rules (where objects are transported without evolving), is given. The frontiers are formulated regarding the length of communication rules, the kind of rules implementing the production of an exponential number of cells/membranes in polynomial time, and the role of the environment. An interesting remark of the obtained results refers that the underlying structure to membrane systems (directed graph versus rooted tree) does not matter in this context.

[1]  Gheorghe Paun,et al.  Spiking Neural dP Systems , 2011, Fundam. Informaticae.

[2]  Mario J. Pérez-Jiménez,et al.  Complexity classes in models of cellular computing with membranes , 2003, Natural Computing.

[3]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[4]  Gheorghe Păun,et al.  Tissue P Systems with Cell Division , 2008, Int. J. Comput. Commun. Control.

[5]  H. Lodish,et al.  Biomembranes: Structural Organization and Basic Functions , 2000 .

[6]  Tao Song,et al.  Limits on Efficient Computation in P Systems with Symport/Antiport Rules , 2017 .

[7]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[8]  Mario J. Pérez-Jiménez,et al.  Characterizing Tractability by Cell-Like Membrane Systems , 2007, Formal Models, Languages and Applications.

[9]  Petr Sosík,et al.  An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation , 2015, Fundam. Informaticae.

[10]  Mario de Jesús Pérez Jiménez,et al.  Characterizing tractability by tissue-like p systems , 2009 .

[11]  Marian Gheorghe,et al.  Real-life Applications with Membrane Computing , 2017 .

[12]  Mario J Pérez-Jiménez,et al.  Efficient solutions to hard computational problems by P systems with symport/antiport rules and membrane division , 2015, Biosyst..

[13]  Mario de Jesús Pérez Jiménez,et al.  Membrane fission versus cell division: When membrane proliferation is not enough , 2015 .

[14]  Mario J. Pérez-Jiménez,et al.  Membrane fission versus cell division: When membrane proliferation is not enough , 2015, Theor. Comput. Sci..

[15]  Mario de Jesús Pérez Jiménez,et al.  Minimal Cooperation in P Systems with Symport/Antiport: A Complexity Approach , 2015 .

[16]  Mario J. Pérez-Jiménez,et al.  Efficient simulation of tissue-like P systems by transition cell-like P systems , 2008, Natural Computing.

[17]  Alfonso Rodríguez-Patón,et al.  Tissue P systems , 2003, Theor. Comput. Sci..

[18]  Mario J. Pérez-Jiménez,et al.  The Efficiency of Tissue P Systems with Cell Separation Relies on the Environment , 2012, Int. Conf. on Membrane Computing.

[19]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[20]  Andrei Paun,et al.  The power of communication: P systems with symport/antiport , 2002, New Generation Computing.

[21]  Giancarlo Mauri,et al.  Characterising the complexity of tissue P systems with fission rules , 2017, J. Comput. Syst. Sci..

[22]  E. Padan,et al.  Sodium-Proton (Na(+)/H(+)) Antiporters: Properties and Roles in Health and Disease. , 2016, Metal ions in life sciences.

[24]  M. J. P. Jiménez,et al.  On the power of dissolution in p systems with active membranes , 2005 .

[25]  Mario J. Pérez-Jiménez,et al.  On the Power of Dissolution in P Systems with Active Membranes , 2005, Workshop on Membrane Computing.

[26]  Maoguo Gong,et al.  Bio-inspired Computing: Theories and Applications , 2018, Communications in Computer and Information Science.

[27]  Bosheng Song,et al.  Membrane fission: A computational complexity perspective , 2016, Complex..