← Back to VOLUME 3, ISSUE 12, DECEMBER 2016
This work is licensed under a Creative Commons Attribution 4.0 International License.
SOLVING MINIMUM CUT COVER WITH ADELMAN-LIPTON MODEL
👁 5 views📥 0 downloads
Abstract: Adleman proved that deoxyribonucleic acid (DNA) strands could be used towards calculating solutions to an instance of the Hamiltonian path problem (HPP). Lipton the next NP problem with this technique. In this paper, we use this model for developing a new DNA algorithm to solve minimum cut cover problem (MCCP). In spite of the NP-hardness of minimum Cut Cover problem (MCCP) our DNA procedures is done in a polynomial time.
Keywords: DNA computing, minimum Cut Cover problem.
How to Cite:
[1] Ahmed A. Sallam, Salwa Badr, “SOLVING MINIMUM CUT COVER WITH ADELMAN-LIPTON MODEL,” International Advanced Research Journal in Science, Engineering and Technology (IARJSET), DOI: 10.17148/IARJSET.2016.31209
This work is licensed under a Creative Commons Attribution 4.0 International License.