Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model.

@article{Chang2003SolvingTS,
  title={Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model.},
  author={Weng Long Chang and Minyi Guo},
  journal={Bio Systems},
  year={2003},
  volume={72 3},
  pages={263-75}
}
Adleman wrote the first paper in which it is shown that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the NP-complete Hamiltonian path problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to solve the NP-complete satisfiability (SAT) problem (the first NP-complete problem). In this paper, it is proved how the DNA operations presented by Adleman and Lipton can be used for developing DNA algorithms to resolving the… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Using Sticker for Solving the874 Dominating-set Problem in the Adleman–Lipton Model. IEICE875 Transaction on Information System

  • Chang, W.-L, M. Guo
  • 2003

Resolving the 3-dimensional

  • Chang, W.-L, M. Guo
  • 2002

Solving the Clique Problem860 and the Vertex Cover Problem in Adleman–Lipton’s861

  • Chang, W.-L, M. Guo
  • Model. In: Proceedings of the IASTED…
  • 2002

Solving the Dominating-set

  • Chang, W.-L, M. Guo
  • 2002

Solid phase DNA

  • N. Morimoto, M. Arita, A. Suyama
  • 1999
3 Excerpts

A heuristic approach

  • M. Arita, A. Suyama, M. Hagiya
  • 1997
3 Excerpts

Similar Papers

Loading similar papers…