Abstract
Membrane computing is a kind of bio-inspired parallel distributed computing paradigm which can reduce computational complexity by the strategy of a space-time tradeoff. Traditionally, there are three kinds of membrane computing models (P systems) based on the tree and the graph topological structures. In this paper, a new P system with chain topological structure is proposed which is called the chain P systems. In the chain P systems, membranes, objects and rules are all in the form of chains which can store more information and therefore further improve the computational efficiency. The computational power and efficiency of the chain P systems are analysed. The graph clustering and the ROCK clustering algorithms based on the chain P systems are given as applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Adaptive and Innovative Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
