Xuncai Zhang, Ruili Fan, Yanfeng Wang, Guangzhao Cui
{"title":"三维DNA自组装的最大团问题","authors":"Xuncai Zhang, Ruili Fan, Yanfeng Wang, Guangzhao Cui","doi":"10.1109/WCICA.2012.6357915","DOIUrl":null,"url":null,"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 θ(n2), and computation space is θ(n3). Our work makes a significant attempt to explore the computational power of 3D DNA self-assembly.","PeriodicalId":114901,"journal":{"name":"Proceedings of the 10th World Congress on Intelligent Control and Automation","volume":"24 67","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"3D DNA self-assembly for the maximum clique problem\",\"authors\":\"Xuncai Zhang, Ruili Fan, Yanfeng Wang, Guangzhao Cui\",\"doi\":\"10.1109/WCICA.2012.6357915\",\"DOIUrl\":null,\"url\":null,\"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 θ(n2), and computation space is θ(n3). Our work makes a significant attempt to explore the computational power of 3D DNA self-assembly.\",\"PeriodicalId\":114901,\"journal\":{\"name\":\"Proceedings of the 10th World Congress on Intelligent Control and Automation\",\"volume\":\"24 67\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 10th World Congress on Intelligent Control and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCICA.2012.6357915\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 10th World Congress on Intelligent Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2012.6357915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
3D DNA self-assembly for the maximum clique problem
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 θ(n2), and computation space is θ(n3). Our work makes a significant attempt to explore the computational power of 3D DNA self-assembly.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
