Consider that the every element in a finite set S having q elements is a positive integer. The set-partition ...

Consider that the every element in a finite set S having q elements is a positive integer. The set-partition

problem is to determine whether there is a subset T Í S such that ,

Î Î

=

x T x T

x x where T = {x| x Î S and

x Ï T}. This research demonstrates that molecular operations can be applied to solve the set-partition

problem. In order to perform this goal, we offer two DNA-based algorithms, an unsigned parallel adder

and a parallel Exclusive-OR (XOR) operation, that formally demonstrate our designed molecular solutions

for solving the set-partition problem.

### Statistics

### Views

- Total Views
- 186
- Views on SlideShare
- 186
- Embed Views

### Actions

- Likes
- 0
- Downloads
- 5
- Comments
- 0

### Accessibility

### Categories

### Upload Details

Uploaded via SlideShare as Adobe PDF

### Usage Rights

© All Rights Reserved

Full NameComment goes here.