Xuncai Zhang, Wenjun Song, Ruili Fan, Guangzhao Cui
{"title":"最小顶点覆盖问题的三维DNA自组装模型","authors":"Xuncai Zhang, Wenjun Song, Ruili Fan, Guangzhao Cui","doi":"10.1109/ISCID.2011.94","DOIUrl":null,"url":null,"abstract":"DNA self-assembly technology has brought novel inspiration to the development of DNA computing. Diversified computational models based on DNA self-assembly have been used to solve various NP problems. In this paper, a three-dimensional (3D) DNA self-assembly model is presented to solve the minimum vertex cover problem. With the capacity of DNA molecules in massive parallel computation, the model can simulate a non-deterministic algorithm and solve the problem in polynomial time. Meanwhile, the computation space of the model is O(n3) and the number of distinct tiles is O(1).","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Three Dimensional DNA Self-Assembly Model for the Minimum Vertex Cover Problem\",\"authors\":\"Xuncai Zhang, Wenjun Song, Ruili Fan, Guangzhao Cui\",\"doi\":\"10.1109/ISCID.2011.94\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"DNA self-assembly technology has brought novel inspiration to the development of DNA computing. Diversified computational models based on DNA self-assembly have been used to solve various NP problems. In this paper, a three-dimensional (3D) DNA self-assembly model is presented to solve the minimum vertex cover problem. With the capacity of DNA molecules in massive parallel computation, the model can simulate a non-deterministic algorithm and solve the problem in polynomial time. Meanwhile, the computation space of the model is O(n3) and the number of distinct tiles is O(1).\",\"PeriodicalId\":224504,\"journal\":{\"name\":\"2011 Fourth International Symposium on Computational Intelligence and Design\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Fourth International Symposium on Computational Intelligence and Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCID.2011.94\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2011.94","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Three Dimensional DNA Self-Assembly Model for the Minimum Vertex Cover Problem
DNA self-assembly technology has brought novel inspiration to the development of DNA computing. Diversified computational models based on DNA self-assembly have been used to solve various NP problems. In this paper, a three-dimensional (3D) DNA self-assembly model is presented to solve the minimum vertex cover problem. With the capacity of DNA molecules in massive parallel computation, the model can simulate a non-deterministic algorithm and solve the problem in polynomial time. Meanwhile, the computation space of the model is O(n3) and the number of distinct tiles is O(1).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
