
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Consider that the every element in a finite set S having q elements is a positive integer. The setpartition
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 setpartition
problem. In order to perform this goal, we offer two DNAbased algorithms, an unsigned parallel adder
and a parallel ExclusiveOR (XOR) operation, that formally demonstrate our designed molecular solutions
for solving the setpartition problem.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment