Related Experiment Video
Updated: Jul 15, 2026

Design and Synthesis of a Reconfigurable DNA Accordion Rack
Published on: August 15, 2018
A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem
Marc García-Arnau1, Daniel Manrique, Alfonso Rodríguez-Patón
1Departamento Inteligencia Artificial, Universidad Politécnica de Madrid (UPM), Boadilla del Monte s/n, 28660 Madrid, Spain. mgarciaarnau@alumnos.upm.es
Abstract:
We present a P system with replicated rewriting to solve the Maximum Clique Problem for a graph. Strings representing cliques are built gradually. This involves the use of inhibitors that control the space of all generated solutions to the problem. Calculating the maximum clique for a graph is a highly relevant issue not only on purely computational grounds, but also because of its relationship to fundamental problems in genomics. We propose to implement the designed P system by means of a DNA algorithm. This algorithm is then compared with two standard papers that addressed the same problem and its DNA implementation in the past. This comparison is carried out on the basis of a series of computational and physical parameters. Our solution features a significantly lower cost in terms of time, the number and size of strands, as well as the simplicity of the biological implementation.
Related Concept Videos
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Theorems of Pappus and Guldinus: Problem Solving
Mechanisms of Membrane Domain Formation
Another mechanism for membrane domain formation involves membrane proteins interacting with cytoskeletal...
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...
Statically Indeterminate Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

