Abstract
With the progress of DNA computing and nanotechnology, DNA/AuNP conjugation becomes an emerging interdisciplinary field. In this paper, a novel DNA computing model based on DNA/AuNP conjugation is developed to solve a maximum independent set problem (MIS). Making use of the hybridization between long DNA strands and short strands conjugated with gold nanoparticles, a series of searching process is implemented. After that, based on the number of DNA/AuNP conjugation on one DNA strand, the answer of the MIS is obtained. To verify the proposed algorithm, a simple paradigm is calculated by using the DNA computing model. In this model, there are some significant advantages such as easy detecting, and controllable automation. This work may demonstrate that DNA computing has the great potentiality in huge parallelism computation.
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.
