Solving the Graph Problem on the Maximal Clique Problem on the P-Systems with Mitochondria Enzymes Layer

• Main Authors: Ford Lumban Gaol, Tokuro Matsuo
• Format: Article
• Language: English
• Published: MDPI AG 2019-12-01
• Series: Applied Sciences
• Subjects: maximal clique; computational layer; p systems; enzymes layers; enzymes control
• Online Access: https://www.mdpi.com/2076-3417/10/1/275

P systems with mitochondria enzymes layer computing is a recent version of P systems; it integrates a new feature inspired from the enzymes gate of a natural cell to the cell-like P systems. The model of a computational layer is well known as a problem of Non-Deterministic (NP-complete) in polynomial time. In this paper, we propose a P systems with enzymes to solve one of the most NP-hard problems, which is the determination of the maximal clique in a given undirected graph. In this context, the evolution strategy proposed is based on using objects under the control of enzymes placed on layers.