{"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}
引用次数: 0
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.