← Back to VOLUME 4, ISSUE 7, JULY 2017
This work is licensed under a Creative Commons Attribution 4.0 International License.
FAST PARALLEL MOLECULAR SOLUTION FOR LONGEST AND SHORTEST PATHS WITH FORBIDDEN PAIRS
👁 5 views📥 0 downloads
Abstract: Adleman demonstrate that we can deoxyribonucleic acid (DNA) strands to solve an instance of the Hamiltonian path problem (HPP). One year later, Lipton solved another NP hard problem. In this paper, we use this model for developing a new DNA algorithm to solve longest and shortest path with forbidden pairs. Our algorithm works in polynomial time.
Keywords: DNA computing, longest and shortest path with forbidden pairs.
How to Cite:
[1] Mahsa Hakimi, Akbar Moazzam, Babak Dalvand, Mehdi S Haghighat, Ahmed A. Sallam, Ardashir Dolati, “FAST PARALLEL MOLECULAR SOLUTION FOR LONGEST AND SHORTEST PATHS WITH FORBIDDEN PAIRS,” International Advanced Research Journal in Science, Engineering and Technology (IARJSET), DOI: 10.17148/IARJSET.2017.4722
This work is licensed under a Creative Commons Attribution 4.0 International License.