Solution of a Satisfiability Problem on a Gel-Based DNA Computer
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
DNA²DNA Computations: A Potential "Killer App"?
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Software Tools for DNA Sequence Design
Genetic Programming and Evolvable Machines
Towards solution of the set-splitting problem on gel-based DNA computing
Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
A DNA sticker algorithm for bit-substitution in a block cipher
Journal of Parallel and Distributed Computing
Solving satisfiability in the tile assembly model with a constant-size tileset
Journal of Algorithms
A DNA-Based Algorithm for the Solution of Not-All-Equal 3-SAT Problem
ICIE '09 Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02
A molecular solution to the hitting-set problem in DNA-based supercomputing
Information Sciences: an International Journal
Data hiding methods based upon DNA sequences
Information Sciences: an International Journal
A generic approach to proving NP-hardness of partition type problems
Discrete Applied Mathematics
| Hi-index | 0.00 |
Given a set of numbers, the three-partition problem is to divide them into disjoint triplets that all have the same sum. The problem is NP-complete. This paper presents an algorithm to solve this problem using the biomolecular computing approach. The algorithm uses a distinctive encoding technique that depends on the numbers values which omits the need to an adder to find the sum. The algorithm is explained and an analysis of its complexity in terms of time, the number of strands, number of tubes, and the longest library strand used is presented. A simulation of the algorithm is implemented and tested. This algorithm further proves the ability of molecular computing in solving hard problems.