Now showing items 1-5 of 5
A linear-time tissue P system based solution for the 3-coloring problem [Article]
In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found (obviously, trading space for time). Recently, different new ...
A uniform family of tissue P systems with cell division solving 3-COL in a linear time [Article]
Several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found in the literature(obviously, trading space for time). Recently, different new models ...
Solving Common Algorithmic Problem by Recognizer Tissue P Systems [Article]
(Romanian Academy, 2012)
Common Algorithmic Problem is an optimization problem, which has the nice property that several other NP-complete problems can be reduced to it in linear time. In this work, we deal with its decision version in the ...
A polynomial alternative to unbounded environment for tissue P systems with cell division [Article]
(Taylor and Francis, 2013)
The standard definition of tissue P systems includes a special alphabet whose elements are assumed to appear in the initial configuration of the system in an arbitrarily large number of copies. These objects reside in ...
Membrane fission versus cell division: When membrane proliferation is not enough [Article]
Cell division is a process that produces two or more cells from one cell by replicating the original chromosomes so that each daughter cell gets a copy of them. Membrane fission is a process by which a biological membrane ...