Abstract
DNA self-assembly technology has brought some novel inspirations to the development of DNA computing. At present, there are many diversified computational models to solve various NP problems, some of which are very useful to solve complex NP problems. In this paper, we introduce how the 3D self-assembly model to solve the maximum clique problem, with the capacity of DNA molecules in massive parallel computation. In this model, the number of distinct tiles used in the computing is a constant - 15, computation time is θ(n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ), and computation space is θ(n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> ). Our work makes a significant attempt to explore the computational power of 3D DNA self-assembly.
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.
