0-1规划问题的质粒DNA计算模型

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI:10.1109/BICTA.2010.5645341

Zhixiang Yin, Hua Chen, Bosheng Song

{"title":"0-1规划问题的质粒DNA计算模型","authors":"Zhixiang Yin, Hua Chen, Bosheng Song","doi":"10.1109/BICTA.2010.5645341","DOIUrl":null,"url":null,"abstract":"0–1 programming, a special case of integer programming, is a typical Hard computing problem. It has close relation to other NP-complete problems. In this paper, a DNA algorithm by operating on plasmids was presented to solve the problem. The proposed method clearly showed the distinct advantage of plasmid DNA computing model in terms of integer computation.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Plasmid DNA computing model of 0–1 programming problem\",\"authors\":\"Zhixiang Yin, Hua Chen, Bosheng Song\",\"doi\":\"10.1109/BICTA.2010.5645341\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"0–1 programming, a special case of integer programming, is a typical Hard computing problem. It has close relation to other NP-complete problems. In this paper, a DNA algorithm by operating on plasmids was presented to solve the problem. The proposed method clearly showed the distinct advantage of plasmid DNA computing model in terms of integer computation.\",\"PeriodicalId\":302619,\"journal\":{\"name\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICTA.2010.5645341\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2010.5645341","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

0-1规划是典型的硬计算问题，是整数规划的一种特例。它与其他np完全问题有密切的关系。本文提出了一种对质粒进行操作的DNA算法来解决这一问题。该方法在整数计算方面显示出质粒DNA计算模型的明显优势。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Plasmid DNA computing model of 0–1 programming problem

0–1 programming, a special case of integer programming, is a typical Hard computing problem. It has close relation to other NP-complete problems. In this paper, a DNA algorithm by operating on plasmids was presented to solve the problem. The proposed method clearly showed the distinct advantage of plasmid DNA computing model in terms of integer computation.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)

自引率

0.00%

发文量