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

Fast parallel DNA-based algorithms for molecular computation: the set-partition problem.

Weng-Long Chang1

  • 1Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung 807, Taiwan, R.O.C. changwl@cc.kuas.edu.tw

IEEE Transactions on Nanobioscience
|January 26, 2008
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

Bioinspired Quantum Oracle Circuits for Biomolecular Solutions of the Maximum Cut Problem.

IEEE transactions on nanobioscience·2024
Same author

Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks.

Scientific reports·2023
Same author

Quantum Speedup for Inferring the Value of Each Bit of a Solution State in Unsorted Databases Using a Bio-Molecular Algorithm on IBM Quantum's Computers.

IEEE transactions on nanobioscience·2021
Same author

Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers.

IEEE transactions on nanobioscience·2021
Same author

Quantum Speedup for Protein Structure Prediction.

IEEE transactions on nanobioscience·2021
Same author

The DNA-Based Algorithms of Implementing Arithmetical Operations of Complex Vectors on a Biological Computer.

IEEE transactions on nanobioscience·2015
Same journal

A Transparent, Microfluidic Lab On A Chip For Multi-Modal Cell Culture Monitoring For Neurotoxicity Research.

IEEE transactions on nanobioscience·2026
Same journal

Investigating Effect of Dimensional Variance on Separation of Glomerular Ultrafiltrate in a Microfluidic Environment.

IEEE transactions on nanobioscience·2026
Same journal

Green synthesis of multifunctional ZnFe<sub>2</sub>O<sub>4</sub>-MWCNT-Cellulose acetate nanocomposite for peroxidase enzyme immobilization.

IEEE transactions on nanobioscience·2026
Same journal

IoT-Enabled SnO₂-Based Humidity Sensor for Real-Time Monitoring in Neonatal Incubators.

IEEE transactions on nanobioscience·2026
Same journal

Electrokinetic and Antibiofilm Effects of Silver Nanoparticles Combined with Imipenem Against multidrug-resistant of Klebsiella pneumoniae.

IEEE transactions on nanobioscience·2026
Same journal

Bio-inspired Optofluidic Molecular Communication with Photothermally Actuated Microrobot Swarms.

IEEE transactions on nanobioscience·2026
See all related articles

This study shows basic biological operations can solve the set-partition problem using novel DNA-based algorithms. Molecular solutions were verified using signed parallel adders, subtractors, and comparators.

Area of Science:

  • Computational Biology
  • Molecular Computing
  • Algorithm Design

Background:

  • The set-partition problem is a complex combinatorial problem with significant computational challenges.
  • Existing methods for solving the set-partition problem often require substantial computational resources.
  • Exploring novel computational paradigms, such as molecular computing, is crucial for addressing complex problems.

Purpose of the Study:

  • To demonstrate the feasibility of using basic biological operations to solve the set-partition problem.
  • To introduce novel DNA-based algorithms for molecular computation.
  • To formally verify molecular solutions for the set-partition problem.

Main Methods:

  • Development of three DNA-based algorithms: a signed parallel adder, a signed parallel subtractor, and a signed parallel comparator.

Related Experiment Videos

  • Utilizing molecular operations to represent and manipulate data for the set-partition problem.
  • Formal verification of the designed molecular algorithms.

    • Main Results:

    • Successful demonstration of solving the set-partition problem using DNA-based molecular operations.
    • The proposed algorithms provide a novel approach to tackling combinatorial problems.
    • Formal verification confirmed the correctness of the molecular solutions.

    Conclusions:

    • Basic biological operations, implemented through DNA algorithms, offer a viable approach to solving the set-partition problem.
    • Molecular computing presents a promising alternative for complex computational tasks.
    • This research lays the groundwork for future advancements in DNA-based algorithms and molecular solutions.