Skip to main content

A Grid-Based Chameleon Algorithm Based on the Tissue-Like P System with Promoters and Inhibitors

Buy Article:

$107.14 + tax (Refund Policy)

Membrane computing is a novel research branch of bio-inspired computing, which seeks to discover new computational models/framework from biological cells. The obtained computing models are usually called P systems, which are a class of parallel and distributed computing models. In this work, Chameleon algorithm is improved by using grid-based clustering algorithm and parallel evolution mechanism and hierarchical membrane structure in tissue-like P systems with promoters and inhibitors, where promoters and inhibitors are utilized to regulate parallelism of objects evolution. Experiment results show that the proposed algorithm performs well in big cluster analysis. The time complexity is improved to O(n), in comparison with conventional Chameleon algorithm of O(n2). The results give some hints to improve conventional algorithms by using the hierarchical framework and parallel evolution mechanism in membrane computing models.

Keywords: CHAMELEON ALGORITHM; CLUSTERING; GRID-BASED CLUSTERING; MEMBRANE COMPUTING; TISSUE-LIKE P SYSTEM

Document Type: Research Article

Publication date: 01 June 2016

More about this publication?
  • Journal of Computational and Theoretical Nanoscience is an international peer-reviewed journal with a wide-ranging coverage, consolidates research activities in all aspects of computational and theoretical nanoscience into a single reference source. This journal offers scientists and engineers peer-reviewed research papers in all aspects of computational and theoretical nanoscience and nanotechnology in chemistry, physics, materials science, engineering and biology to publish original full papers and timely state-of-the-art reviews and short communications encompassing the fundamental and applied research.
  • Editorial Board
  • Information for Authors
  • Submit a Paper
  • Subscribe to this Title
  • Terms & Conditions
  • Ingenta Connect is not responsible for the content or availability of external websites
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content