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 Concept Videos

Mathematical Modeling: Problem Solving01:29

Mathematical Modeling: Problem Solving

Mathematical modeling transforms real-world scenarios into mathematical expressions, allowing for structured problem-solving and analysis. This process involves defining the situation, assigning variables to measurable quantities, selecting an appropriate model, and solving the resulting equation. Such models are invaluable in finance, providing precise methods to evaluate investments, loans, and repayment structures.A widely used example is the calculation of fixed monthly payments on a loan,...
Theorems of Pappus and Guldinus: Problem Solving01:12

Theorems of Pappus and Guldinus: Problem Solving

Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a cylinder...
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
Principle of Moments: Problem Solving01:30

Principle of Moments: Problem Solving

The principle of moments is a fundamental concept in physics and engineering. It refers to the balancing of forces and moments around a point or axis, also known as the pivot. This principle is used in many real-life scenarios, including construction, sports, and daily activities like opening doors and pushing objects.
One such scenario involves a pole placed in a three-dimensional system with a cable attached. When a tension is applied to the cable, the moment about the z-axis passing through...
Growth Models with Integration: Problem Solving01:27

Growth Models with Integration: Problem Solving

In population modeling, integration provides a systematic way to determine accumulated quantities from known rates of change. One such application arises in ecology, where the total weight of a fish population in a body of water is referred to as its biomass. When the rate of growth of this biomass is known as a function of time, calculus can be used to determine the total biomass at a future date.Growth Rate and Biomass FunctionLet the growth rate of the fish population be represented by a...
Castigliano's Theorem: Problem Solving01:14

Castigliano's Theorem: Problem Solving

The deflection of a simply supported beam that carries a central point load can be analyzed using structural mechanics principles, particularly by applying Castigliano's theorem. This theorem relates the displacement at the load application point to the partial derivatives of the strain energy in the structure. The simply supported beam with a point load at its center has symmetric reaction forces at the supports, each bearing half of the load. The bending moment at any point along the beam is...

You might also read

Related Articles

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

Sort by
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

Related Experiment Videos

A new solution for maximal clique problem based sticker model.

Majid Darehmiraki1

  • 1University of Birjand, Factuality of Sciences, Department of Mathematics, Birjand, South Khorasan, Iran. darehmiraki@yahoo.com

Bio Systems
|November 11, 2008
PubMed
Summary
This summary is machine-generated.

This study uses DNA computing and sticker-based models to solve the NP-complete maximal clique problem (MCP). The developed DNA algorithm efficiently resolves the MCP, demonstrating DNA computing

Related Experiment Videos

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Molecular Computing

Background:

  • The maximal clique problem (MCP) is a known NP-complete problem.
  • Traditional computational methods face challenges in solving MCP efficiently.
  • DNA computing offers a potential alternative for complex computational tasks.

Purpose of the Study:

  • To develop a DNA algorithm for solving the maximal clique problem (MCP).
  • To explore the efficacy of sticker-based DNA computing models for NP-complete problems.

Main Methods:

  • Constructing a solution space for MCP using DNA stickers.
  • Applying DNA operations within a sticker-based model to create a DNA algorithm.
  • Analyzing the operational time complexity of the proposed algorithm.

Main Results:

  • The proposed DNA algorithm successfully resolves the maximal clique problem (MCP).
  • Biological operations in the sticker-based model effectively solve MCP within the defined solution space.
  • The algorithm demonstrates a promising operational time complexity of O(nxk).

Conclusions:

  • This work provides evidence for DNA computing's capability in solving NP-complete problems like MCP.
  • The sticker-based DNA computing approach shows significant potential for addressing complex computational challenges.
  • DNA computing offers a viable and efficient strategy for the maximal clique problem.