Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

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

Bio Systems
|April 10, 2007
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Programmable DNA-Based Molecular Reservoir Biocomputing Network Circuits with Emerging Biomemristors for Solving Complex Nonlinear Problems.

ACS synthetic biology·2026
Same author

Programmable DNA-Based Molecular Neural Network Biocomputing Circuits for Solving Partial Differential Equations.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2025
Same author

Estimation of Distribution Algorithm for Grammar-Guided Genetic Programming.

Evolutionary computation·2024
Same author

Towards the portability of knowledge in reinforcement learning-based systems for automatic drone navigation.

PeerJ. Computer science·2023
Same author

DNMG: Deep molecular generative model by fusion of 3D information for de novo drug design.

Methods (San Diego, Calif.)·2023
Same author

BioBlocksLab: A portable DIY Bio Lab using BioBlocks language.

Methods (San Diego, Calif.)·2023
Same journal

Ruliological Resilience: Pattern Restoration and Robustness in Wolfram Patterns. A Basis for Regeneration, Not Just in Cone Shells?

Bio Systems·2026
Same journal

The quantum-to-classical transducer: A thermodynamic and quantum mechanical framework for the emergence of bioenergetics.

Bio Systems·2026
Same journal

Forward-backward gene expression binarization for boolean state inference over a known regulatory network.

Bio Systems·2026
Same journal

Partial-label metric ceilings for evaluating gene regulatory networks inferred from single-cell foundation models.

Bio Systems·2026
Same journal

The impedance mismatch theory: A non-equilibrium thermodynamic framework for a shared energetic stress pathway in neurodegeneration.

Bio Systems·2026
Same journal

Immune signal-status misclassification: A theoretical framework for biological status assignment and failed status resolution.

Bio Systems·2026
See all related articles

This study introduces a novel P system using replicated rewriting to efficiently solve the Maximum Clique Problem. The DNA-based algorithm offers a cost-effective solution for computational and genomic applications.

Area of Science:

  • Computational Biology
  • Theoretical Computer Science
  • Bioinformatics

Background:

  • The Maximum Clique Problem is computationally challenging with significant implications in genomics.
  • Existing computational and DNA-based methods for this problem have limitations.

Purpose of the Study:

  • To present a novel P system with replicated rewriting for solving the Maximum Clique Problem.
  • To implement this P system using a DNA algorithm.
  • To compare the proposed DNA algorithm with existing methods.

Main Methods:

  • Utilizing a P system with replicated rewriting and inhibitors to generate clique solutions.
  • Implementing the P system as a DNA algorithm.
  • Comparing the DNA algorithm against two standard papers on computational and physical parameters.

Related Experiment Videos

Main Results:

  • The proposed P system and DNA algorithm efficiently solve the Maximum Clique Problem.
  • The solution demonstrates significantly lower costs in time, strand count, and strand size.
  • The biological implementation is notably simpler compared to existing approaches.

Conclusions:

  • The developed P system and DNA algorithm provide a superior solution for the Maximum Clique Problem.
  • This approach offers practical advantages for computational and genomic research.
  • The method presents a more efficient and simpler biological implementation strategy.