Abstract
Adleman wrote the first paper in which it was demonstrated that DNA (DeoxyriboNucleic Acid) strands could be applied for dealing with solutions to an instance of the NP complete Hamiltonian path problem (HPP). Lipton wrote the second paper in which it was shown that the Adleman teclmiques could also be used to solving the NP complete satisfiability (SAT) problem (the first NP-complete problem). Adleman and his co authors proposed sticker for enhancing the Adleman Lipton model. In the paper, it is proved how to apply sticker in the sticker based model for constructing solution space of DNA for the set splitting problem and how to apply DNA operations in the Adleman Lipton model to solve that problem from solution space of sticker.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
