Computational power of cell separation in tissue P systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F14%3A%230005317" target="_blank" >RIV/47813059:19240/14:#0005317 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.ins.2014.04.031" target="_blank" >http://dx.doi.org/10.1016/j.ins.2014.04.031</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ins.2014.04.031" target="_blank" >10.1016/j.ins.2014.04.031</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Computational power of cell separation in tissue P systems

Popis výsledku v původním jazyce

The paper focuses on the relation between biological and computational information processing. Several simple biological operations, as the exchange of molecules via cellular membrane or the cellular growth and separation, are abstracted into a mathematical model called membrane system (P system). This paper studies tissue P systems where a fixed interaction graph defines the communication between various types of cells. Polynomially uniform families of tissue P systems with the operation of cell separation were recently studied. Their computational power in polynomial time was shown to range between P and NP [ co ! NP, characterizing borderlines between tractability and intractability by the length of rules controlling the interchange of objects. Here, we show that the computational power of these uniform families is limited by the class PSPACE, which is the class characterizing the power of classical parallel computing models, such as PRAM or the alternating Turing machine.

Název v anglickém jazyce

Computational power of cell separation in tissue P systems

Popis výsledku anglicky

The paper focuses on the relation between biological and computational information processing. Several simple biological operations, as the exchange of molecules via cellular membrane or the cellular growth and separation, are abstracted into a mathematical model called membrane system (P system). This paper studies tissue P systems where a fixed interaction graph defines the communication between various types of cells. Polynomially uniform families of tissue P systems with the operation of cell separation were recently studied. Their computational power in polynomial time was shown to range between P and NP [ co ! NP, characterizing borderlines between tractability and intractability by the length of rules controlling the interchange of objects. Here, we show that the computational power of these uniform families is limited by the class PSPACE, which is the class characterizing the power of classical parallel computing models, such as PRAM or the alternating Turing machine.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: Centrum excelence IT4Innovations</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Information Sciences

ISSN

0020-0255

e-ISSN

—

Svazek periodika

279

Číslo periodika v rámci svazku

neuveden

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

11

Strana od-do

805-815

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—