基于量子遗传学的DNA编码优化设计改进模拟退火

Haojie Wu, Changjun Zhou
{"title":"基于量子遗传学的DNA编码优化设计改进模拟退火","authors":"Haojie Wu, Changjun Zhou","doi":"10.1145/3569966.3570078","DOIUrl":null,"url":null,"abstract":"DNA computing is a field combining computer science and molecular biology. The DNA coding is the core problem in DNA computing and related research fields. DNA coding research mainly involves two aspects: one is to obtain a sufficient number of DNA sequences under the premise that the coding quality has met the requirements; the other is to improve the coding quality as much as possible under the condition that the coding quantity is sufficient. This paper focuses on the study of the former. This paper improves the Simulated Annealing(SA) algorithm and combines it into a Quantum Chaos-Simulated Annealing algorithm to improve the lower bound of the DNA coding set. The experimental findings demonstrate that this algorithm’s code set outcomes are superior than those of other methods.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improved Simulated Annealing Based on Quantum Genetics for DNA Coding Optimization Design\",\"authors\":\"Haojie Wu, Changjun Zhou\",\"doi\":\"10.1145/3569966.3570078\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"DNA computing is a field combining computer science and molecular biology. The DNA coding is the core problem in DNA computing and related research fields. DNA coding research mainly involves two aspects: one is to obtain a sufficient number of DNA sequences under the premise that the coding quality has met the requirements; the other is to improve the coding quality as much as possible under the condition that the coding quantity is sufficient. This paper focuses on the study of the former. This paper improves the Simulated Annealing(SA) algorithm and combines it into a Quantum Chaos-Simulated Annealing algorithm to improve the lower bound of the DNA coding set. The experimental findings demonstrate that this algorithm’s code set outcomes are superior than those of other methods.\",\"PeriodicalId\":145580,\"journal\":{\"name\":\"Proceedings of the 5th International Conference on Computer Science and Software Engineering\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 5th International Conference on Computer Science and Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3569966.3570078\",\"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 5th International Conference on Computer Science and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3569966.3570078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

DNA计算是计算机科学和分子生物学相结合的一个领域。DNA编码是DNA计算及相关研究领域的核心问题。DNA编码研究主要涉及两个方面:一是在编码质量满足要求的前提下获得足够数量的DNA序列;二是在编码数量充足的情况下,尽可能提高编码质量。本文主要对前者进行研究。本文对模拟退火算法进行了改进,并将其结合到量子混沌-模拟退火算法中,以提高DNA编码集的下界。实验结果表明,该算法的码集结果优于其他方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Improved Simulated Annealing Based on Quantum Genetics for DNA Coding Optimization Design
DNA computing is a field combining computer science and molecular biology. The DNA coding is the core problem in DNA computing and related research fields. DNA coding research mainly involves two aspects: one is to obtain a sufficient number of DNA sequences under the premise that the coding quality has met the requirements; the other is to improve the coding quality as much as possible under the condition that the coding quantity is sufficient. This paper focuses on the study of the former. This paper improves the Simulated Annealing(SA) algorithm and combines it into a Quantum Chaos-Simulated Annealing algorithm to improve the lower bound of the DNA coding set. The experimental findings demonstrate that this algorithm’s code set outcomes are superior than those of other methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Accurate and Time-saving Deepfake Detection in Multi-face Scenarios Using Combined Features The Exponential Dynamic Analysis of Network Attention Based on Big Data Research on Data Governance and Data Migration based on Oracle Database Appliance in campus Research on Conformance Engineering process of Airborne Software quality Assurance in Civil Aviation Extending Take-Grant Model for More Flexible Privilege Propagation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1