51 search results - page 2 / 11 » A DNA Sticker Algorithm for Solving N-Queen Problem |
IPPS
2000
IEEE
13 years 10 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
MEMBRANE
2005
Springer
13 years 11 months ago
2005
Springer
In the present paper we propose a way to simulate Boolean gates and circuits in the framework of P systems with active membranes using inhibiting/de-inhibiting rules. This new appr...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
CPM
2005
Springer
13 years 11 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
DNA
2004
Springer
13 years 11 months ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...