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

Solving maximum cut problems in the Adleman-Lipton model.

Dongmei Xiao1, Wenxia Li, Zhizhou Zhang

  • 1Bio-X DNA Computer Consortium, Shanghai Jiao Tong University, Shanghai 200030, PR China.

Bio Systems
|October 21, 2005
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

The stability and bifurcations of ecosystems within resource constraints - Dedicated to Professor Shigui Ruan on the occasion of his 60th birthday.

Mathematical biosciences·2026
Same author

Diagnostic performance of conventional ultrasound and shear wave elastography of the parotid glands in primary Sjögren's syndrome.

BMC medical imaging·2026
Same author

Childhood trauma and anxiety symptoms among Chinese university students: the moderating and mediating roles of mindfulness.

BMC psychology·2026
Same author

Serum protein profiles in lupus nephritis associated with initial-onset systemic lupus erythematosus: Characterization through PEA immunoassay and preliminary development of predictive model.

Cytokine·2025
Same author

Epidemiologic characteristics of immunoglobulin M antibodies in lower respiratory tract infection pathogens of children: association with severe pneumonia in Chengdu city from 2019 to 2023.

American journal of translational research·2025
Same author

Augmented insights and minor adjustments to the role of adhesin proteins in <i>Acinetobacter baumannii</i> infections.

Infection and immunity·2025
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 presents an efficient procedure for solving maximum cut problems within the Adleman-Lipton model. The novel approach achieves a time complexity of O(n2) for undirected graphs with n vertices.

Area of Science:

  • Computational complexity theory
  • Graph theory
  • Theoretical computer science

Background:

  • Maximum cut problems are fundamental in graph theory and computer science.
  • The Adleman-Lipton model provides a theoretical framework for computation.

Purpose of the Study:

  • To develop an efficient procedure for solving maximum cut problems.
  • To analyze the computational complexity of this procedure within the Adleman-Lipton model.

Main Methods:

  • Consideration of a specific procedure for maximum cut problems.
  • Analysis of the procedure's performance on undirected graphs.
  • Evaluation within the Adleman-Lipton computational model.

Main Results:

Related Experiment Videos

  • The proposed procedure effectively solves maximum cut problems.
  • The procedure demonstrates a time complexity of O(n2) for graphs with n vertices.

    • Conclusions:

    • The developed procedure offers an efficient solution for maximum cut problems.
    • The findings contribute to understanding computational limits in the Adleman-Lipton model.