The Application of DNA Nanoparticle Conjugates on the Graph’s Connectivity Problem.pdfVIP

The Application of DNA Nanoparticle Conjugates on the Graph’s Connectivity Problem Yafei Dong, Yanchai Wang, Jingjing Ma and Li Jia Abstract A DNA computing algorithm is proposed in this paper which uses the assembly process of DNA-AuNP (DNA Au nanoparticle) conjugates to solve an NP-complete problem in the Graph theory, the connectivity problem, and a 3D DNA self-assembly algorithm model are also established. According to the algorithm we need to design the special DNA-AuNP conjugates which will assemble based on a specific graph, then a series of experiments are performed to get the final answer. This biochemical algorithm could reduce the complexity of the connectivity problem. The biochemical experimental technologies are mature and available, which will provide a practical way to validate the practicability and effect of DNA self-assembly algorithm model. Keywords DNA computing DNA-AuNP Graph’s connectivity 3D model The Yafei Dong and Jinjin Ma, their main research are biological computing and gene network. Yanchai Wang, the main research areas is gene network.The authors Yafei Dong and Jinjin Ma are contributed equally. Y. Dong () J. Ma () L. Jia College of Life Science, Shaanxi Normal University, Xi’an 710062 Shaanxi, People’s Republic of China e-mail: dongyf@ Y. Dong Y. Wang College of Computer Science, Shannxi Normal University, Xi’an 710062 Shaanxi, People’s Republic of China Y. Wang e-mail: wangyanchai1025@163.com J. Ma School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, People’s Republic of China e-mail: casy-20@126.com Z. Yin et al. (eds.), Proceedings of The Eighth International Conference 257 on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013, Advances in Intelligent Systems and Computing 212, DOI: 10.1007/978-3-642-37502-6_32, Springer-Verlag Berlin Heidelberg 2013 2