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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.