Membrane fission versus cell division: When membrane proliferation is not enough

Macas-Ramos, Luis F.; Prez-Jimnez, Mario J.; Riscos-Nez, Agustn; Valencia-Cabrera, Luis

doi:10.1016/j.tcs.2015.06.025

Cited by 15 publications

(13 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is worth developing the applications of BP systems. Bio-inspiring computing models perform well in computations, particularly in solving computational complex problems in feasible time [ 34 , 35 , 36 ]. It is of interest to use BP systems to solve computationally hard problems.…”

Section: Discussionmentioning

confidence: 99%

Small Universal Bacteria and Plasmid Computing Systems

Wang

Zheng

et al. 2018

Molecules

View full text Add to dashboard Cite

Bacterial computing is a known candidate in natural computing, the aim being to construct “bacterial computers” for solving complex problems. In this paper, a new kind of bacterial computing system, named the bacteria and plasmid computing system (BP system), is proposed. We investigate the computational power of BP systems with finite numbers of bacteria and plasmids. Specifically, it is obtained in a constructive way that a BP system with 2 bacteria and 34 plasmids is Turing universal. The results provide a theoretical cornerstone to construct powerful bacterial computers and demonstrate a concept of paradigms using a “reasonable” number of bacteria and plasmids for such devices.

show abstract

Section: Discussionmentioning

confidence: 99%

Small Universal Bacteria and Plasmid Computing Systems

Wang

Zheng

et al. 2018

Molecules

View full text Add to dashboard Cite

show abstract

“…The computational efficiency of a computing model in a computing paradigm, refers to its ability to provide polynomial time solutions for computationally hard problems by making use of an exponential workspace constructed in a "natural way". Following [11], a computing model is said to be efficient (respectively, presumably efficient) if it has the ability to provide polynomial-time solutions for intractable problems (resp., NP-complete problems). The term presumably efficient refers to the fact that in the case, generally believed, that P = NP, each NP-complete problem is an intractable one; consequently, under this hypothesis, any presumably efficient computing model would be efficient.…”

Section: Computational Efficiencymentioning

confidence: 99%

Proof techniques in Membrane Computing

Orellana-Martín

Valencia-Cabrera

Pérez–Jiménez

2021

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

From the creation of the field of Membrane Computing in 1998, several research lines have been opened. On the one hand, theoretical questions like the computational power and the computational efficiency of P systems have been studied. In this sense, several techniques to demonstrate the ability of these systems to provide solutions to computational problems have been explored. The study of efficient (polynomial-time) solutions to presumably hard problems for finding thin frontiers of efficiency is a very active area. On the other hand, several applications in biology, ecology, economy, robotics and fault diagnosis, among others, have been investigated. Real systems with some characteristics seem to be easy to model with membrane systems due to their behaviour. In this work, a survey of the theoretical part will be given, explaining techniques both in the field of computability theory and in the field of computational complexity theory.

show abstract

“…On the other hand, in [23], a polynomialtime solution of the HAM-CYCLE problem, was given by using a family of recognizer P systems with membrane division division and communication rules of length at most 2. Therefore, we have: 6.4 Membrane systems with symport/antiport rules and without environment By using the algorithmic technique, it has been proved that only problems in class P can be solved in polynomial time by means of families of tissue-like P systems with symport/ antiport rules and cell separation but without environment (see [25] for tissue-like P systems and [26] for cell-like P systems). Therefore, we have:…”

Section: Proposition 2 P ¼ Pmc Tdcð1þ \ Pmc Cdcð1þmentioning

confidence: 99%

The role of integral membrane proteins in computational complexity theory

Orellana-Martín

Amor

Valencia-Cabrera

et al. 2018

Int J Adv Eng Sci Appl Math

Self Cite

View full text Add to dashboard Cite

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 (tissuelike 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.

show abstract

Membrane fission versus cell division: When membrane proliferation is not enough

Cited by 15 publications

References 16 publications

Small Universal Bacteria and Plasmid Computing Systems

Small Universal Bacteria and Plasmid Computing Systems

Proof techniques in Membrane Computing

The role of integral membrane proteins in computational complexity theory

Contact Info

Product

Resources

About