<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miguel A. Gutiérrez-Naranjo</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Agustín Riscos-Núñez</style></author><author><style face="normal" font="default" size="100%">Francisco J. Romero-Campero</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On the efficiency of cell-like and tissue-like recognizing membrane systems</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Intelligent Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">05/2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www3.interscience.wiley.com/journal/122383409/abstract?CRETRY=1&SRETRY=0</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">24</style></volume><pages><style face="normal" font="default" size="100%">747-765</style></pages><abstract><style face="normal" font="default" size="100%">Cell-like recognizing membrane systems are computational devices in the framework of membrane computing inspired from the structure of living cells, where biological membranes are arranged hierarchically. In this paper tissue-like recognizing membrane systems are presented. The idea is to consider that membranes are placed in the nodes of a graph, mimicking the cell intercommunication in tissues.
In this context, polynomial complexity classes associated with recognizing membrane systems can be defined. We recall the definition for cell-like systems, and we introduce the corresponding complexity classes for the tissue-like case. Moreover, in this paper two efficient solutions to the satisfiability problem are analyzed and compared from a complexity point of view. © 2009 Wiley Periodicals, Inc.</style></abstract><issue><style face="normal" font="default" size="100%">7</style></issue><custom1><style face="normal" font="default" size="100%">1.194</style></custom1><custom2><style face="normal" font="default" size="100%">63/103 - Q3</style></custom2></record></records></xml>