A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time

2016 ◽  
Vol 17 (2) ◽  
pp. 311-319 ◽  
Author(s):  
A. Hepzibah Christinal ◽  
Daniel Díaz-Pernil ◽  
T. Mathu
Keyword(s):  
Linear Time ◽  
P Systems

scholarly journals Bio-inspired Membrane Operations in P Systems with Active Membranes

Triangle ◽  
2018 ◽  
pp. 19
Author(s):  
Artiom Alhazov ◽  
Tseren-Onolt Ishdorj
Keyword(s):  
General Class ◽  
Membrane Structure ◽  
Membrane Separation ◽  
Linear Time ◽  
P Systems ◽  
Sat Problem ◽  
Separation Membrane ◽  
Active Membranes

In this paper we define a general class of P systems covering some biological operations with membranes, including evolution, communication, and modifying the membrane structure, and we describe and formally specify some of these operations: membrane merging, membrane separation, membrane release. We also investigate a particular combination of types of rules that can be used in solving the SAT problem in linear time.

Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division

2007 ◽  
pp. 170-179 ◽  
Author(s):  
Daniel Díaz-Pernil ◽  
Miguel A. Gutiérrez-Naranjo ◽  
Mario J. Pérez-Jiménez ◽  
Agustín Riscos-Núñez
Keyword(s):  
Cell Division ◽  
Linear Time ◽  
P Systems ◽  
Subset Sum

Discrete Morse Theory Based Dynamic P Systems

2018 ◽  
Vol 22 (1) ◽  
pp. 104-112
Author(s):  
Jie Xue ◽  
◽  
Xiyu Liu ◽  
Wenxing Sun ◽  
Shuo Yan
Keyword(s):  
Air Quality ◽  
Quality Evaluation ◽  
Morse Function ◽  
Membrane Computing ◽  
Linear Time ◽  
P Systems ◽  
P System ◽  
Gradient Vector ◽  
Evaluation Problem ◽  
Gradient Vector Field

This paper proposes a class of dynamic P systems with constraint of discrete Morse function (DMDP systems). Membrane structure is extended on complex. Rules control activities of membranes. New classes of rules and mechanism to change types of rules by discrete gradient vector field are provided as well.DMDP system extends P systems both in structures and rules. Solving air quality evaluation problem in linear time verifies the effectiveness ofDMDP systems. Since air quality evaluation problem has significance in many areas. The new P systems provide an alternative for traditional membrane computing.

scholarly journals Time-Free Solution to Hamilton Path Problems Using P Systems withd-Division

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Tao Song ◽  
Xun Wang ◽  
Hongjiang Zheng
Keyword(s):  
Execution Time ◽  
Linear Time ◽  
Hamiltonian Path ◽  
P Systems ◽  
Free Solution ◽  
Hamilton Path ◽  
Working Space ◽  
A Cell ◽  
Hard Problems ◽  
Computing Models

P systems withd-division are a particular class of distributed and parallel computing models investigated in membrane computing, which are inspired from the budding behavior of Baker’s yeast (a cell can generate several cells in one reproducing cycle). In previous works, such systems can theoretically generate exponential working space in linear time and thus provide a way to solve computational hard problems in polynomial time by a space-time tradeoff, where the precise execution time of each evolution rule, one time unit, plays a crucial role. However, the restriction that each rule has a precise same execution time does not coincide with the biological fact, since the execution time of biochemical reactions can vary because of external uncontrollable conditions. In this work, we consider timed P systems withd-division by adding a time mapping to the rules to specify the execution time for each rule, as well as the efficiency of the systems. As a result, a time-free solution to Hamiltonian path problem (HPP) is obtained by a family of such systems (constructed in a uniform way), that is, the execution time of the rules (specified by different time mappings) has no influence on the correctness of the solution.

scholarly journals Solving Vertex Cover Problem by Means of Tissue P Systems with Cell Separation

2010 ◽  
Vol 5 (4) ◽  
pp. 540 ◽  
Author(s):  
Chun Lu ◽  
Xingyi Zhang
Keyword(s):  
Cell Separation ◽  
Membrane Computing ◽  
Linear Time ◽  
Vertex Cover ◽  
P Systems ◽  
Computing Model ◽  
Vertex Cover Problem ◽  
Complete Problems ◽  
Np Complete ◽  
Cover Problem

Tissue P systems is a computing model in the framework of membrane computing inspired from intercellular communication and cooperation between neurons. Many different variants of this model have been proposed. One of the most important models is known as tissue P systems with cell separation. This model has the ability of generating an exponential amount of workspace in linear time, thus it allows us to design cellular solutions to NP-complete problems in polynomial time. In this paper, we present a solution to the Vertex Cover problem via a family of such devices. This is the first solution to this problem in the framework of tissue P systems with cell separation.

Semi-Uniform Solution for Common Algorithmic Problem by P System in the Minimally Parallel Mode

2014 ◽  
Vol 568-570 ◽  
pp. 802-806
Author(s):  
Yun Yun Niu ◽  
Zhi Gao Wang
Keyword(s):  
Linear Time ◽  
P Systems ◽  
P System ◽  
Algorithmic Problem ◽  
Complete Problems ◽  
Active Membranes ◽  
Uniform Solution ◽  
Parallel Mode ◽  
The Common ◽  
Np Complete

It is known that the Common Algorithmic Problem (CAP) has a nice property that several other NP-complete problems can be reduced to it in linear time. In the literature, the decision version of this problem can be efficiently solved with a family of recognizer P systems with active membranes with three electrical charges working in the maximally parallel way. We here work with a variant of P systems with active membranes that do not use polarizations and present a semi-uniform solution to CAP in the minimally parallel mode.

scholarly journals Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division

2011 ◽  
Vol 2 (3) ◽  
pp. 49-60 ◽  
Author(s):  
Xingyi Zhang ◽  
Yunyun Niu ◽  
Linqiang Pan ◽  
Mario J. Pérez-Jiménez
Keyword(s):  
Cell Division ◽  
Quantum Computer ◽  
Linear Time ◽  
Public Key Cryptography ◽  
Polynomial Time Algorithm ◽  
P Systems ◽  
Public Key ◽  
Prime Factorization ◽  
Factorization Problem ◽  
Time Solution

Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer was given by P. W. Shor in 1997. In this work, it is considered as a function problem, and in the framework of tissue P systems with cell division, a linear-time solution to prime factorization problem is given on biochemical computational devices – tissue P systems with cell division, instead of computational devices based on the laws of quantum physical.

Sign in / Sign up

Export Citation Format

Share Document