<?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%">L. Ye</style></author><author><style face="normal" font="default" size="100%">J. Zheng</style></author><author><style face="normal" font="default" size="100%">P. Guo</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Access</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">0-1 knapsack problem</style></keyword><keyword><style  face="normal" font="default" size="100%">Approximation algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">Biocomputing</style></keyword><keyword><style  face="normal" font="default" size="100%">biological cell mechanism</style></keyword><keyword><style  face="normal" font="default" size="100%">Biological system modeling</style></keyword><keyword><style  face="normal" font="default" size="100%">Biomembranes</style></keyword><keyword><style  face="normal" font="default" size="100%">cell division</style></keyword><keyword><style  face="normal" font="default" size="100%">classic NP-hard problems</style></keyword><keyword><style  face="normal" font="default" size="100%">combinatorial optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">Computational Complexity</style></keyword><keyword><style  face="normal" font="default" size="100%">computational efficiency</style></keyword><keyword><style  face="normal" font="default" size="100%">computational model</style></keyword><keyword><style  face="normal" font="default" size="100%">Computational modeling</style></keyword><keyword><style  face="normal" font="default" size="100%">distributed computing model</style></keyword><keyword><style  face="normal" font="default" size="100%">Heuristic algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">knapsack problems</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">membrane simulator</style></keyword><keyword><style  face="normal" font="default" size="100%">parallel computing model</style></keyword><keyword><style  face="normal" font="default" size="100%">Parallel processing</style></keyword><keyword><style  face="normal" font="default" size="100%">Prediction algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">Tissue P System</style></keyword><keyword><style  face="normal" font="default" size="100%">UPSimulator</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><volume><style face="normal" font="default" size="100%">7</style></volume><pages><style face="normal" font="default" size="100%">66055-66067</style></pages></record><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%">Bosheng Song</style></author><author><style face="normal" font="default" size="100%">Linqiang Pan</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Tissue P Systems with Protein on Cells</style></title><secondary-title><style face="normal" font="default" size="100%">Fundamenta Informaticae</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">bio-inspired computing</style></keyword><keyword><style  face="normal" font="default" size="100%">cell division</style></keyword><keyword><style  face="normal" font="default" size="100%">Cell protein</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Tissue P System</style></keyword><keyword><style  face="normal" font="default" size="100%">Universality</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2016</style></year><pub-dates><date><style  face="normal" font="default" size="100%">03/2016</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://content.iospress.com/articles/fundamenta-informaticae/fi1324</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IOS Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Warsaw, Poland</style></pub-location><volume><style face="normal" font="default" size="100%">144</style></volume><pages><style face="normal" font="default" size="100%">77-107</style></pages><abstract><style face="normal" font="default" size="100%">Tissue P systems are a class of distributed parallel computing devices inspired by biochemical interactions between cells in a tissue-like arrangement, where objects can be exchanged by means of communication channels. In this work, inspired by the biological facts that the movement of most objects through communication channels is controlled by proteins and proteins can move through lipid bilayers between cells (if these cells are fused), we present a new class of variant tissue P systems, called tissue P systems with protein on cells, where multisets of objects (maybe empty), together with proteins between cells are exchanged. The computational power of such P systems is studied. Specifically, an efficient (uniform) solution to the SAT problem by using such P systems with cell division is presented. We also prove that any Turing computable set of numbers can be generated by a tissue P system with protein on cells. Both of these two results are obtained by such P systems with communication rules of length at most 4 (the length of a communication rule is the total number of objects and proteins involved in that rule).</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue><custom1><style face="normal" font="default" size="100%">0.717</style></custom1><custom2><style face="normal" font="default" size="100%">71/104 - Q3</style></custom2></record><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%">Xingyi Zhang</style></author><author><style face="normal" font="default" size="100%">Yunyun Niu</style></author><author><style face="normal" font="default" size="100%">Linqiang Pan</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Natural Computing Research</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">cryptography</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Polynomial-Time Algorithm</style></keyword><keyword><style  face="normal" font="default" size="100%">Prime Factorization</style></keyword><keyword><style  face="normal" font="default" size="100%">Tissue P System</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">07/2011</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.igi-global.com/article/linear-time-solution-prime-factorization/58066</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IGI Global</style></publisher><pub-location><style face="normal" font="default" size="100%">Hershey, Pennsylvania (USA)</style></pub-location><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">49-60</style></pages><abstract><style face="normal" font="default" size="100%">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.</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record></records></xml>