{"title":"基于细菌觅食算法的DNA计算序列设计","authors":"Jiankang Ren, Yao Yao","doi":"10.1145/3309129.3309147","DOIUrl":null,"url":null,"abstract":"Since the quantity and quality of DNA sequence directly affect the accuracy and efficiency of computation, the design of DNA sequence is critical to DNA computing. In order to improve the reliability of DNA computing, there is a rich literature targeting at making DNA sequences specifically hybridize at a lower melting temperature, no non-complementary bases pairs or mismatch hybridization in the reformed double helix. However, most of them are not good enough to control the melting temperature, because DNA sequence design problem under the constraints of hamming distance, secondary structure, molecular thermodynamic is known to be NP-hard. For the sake of achieving the lower and similar melting temperature for each DNA sequence, we proposed a DNA sequence coding method based on Bacterial Foraging Algorithm (BFA). An evaluation criterion is particularly proposed to assess the quality of DNA sequence in the optimization process. With BFA, high-quality DNA strands are replicated to avoid the participation of inferior strands in the operation. Experiments show our proposed approach significantly outperforms existing methods in terms of continuity and melting temperature.","PeriodicalId":326530,"journal":{"name":"Proceedings of the 5th International Conference on Bioinformatics Research and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"DNA Computing Sequence Design Based on Bacterial Foraging Algorithm\",\"authors\":\"Jiankang Ren, Yao Yao\",\"doi\":\"10.1145/3309129.3309147\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since the quantity and quality of DNA sequence directly affect the accuracy and efficiency of computation, the design of DNA sequence is critical to DNA computing. In order to improve the reliability of DNA computing, there is a rich literature targeting at making DNA sequences specifically hybridize at a lower melting temperature, no non-complementary bases pairs or mismatch hybridization in the reformed double helix. However, most of them are not good enough to control the melting temperature, because DNA sequence design problem under the constraints of hamming distance, secondary structure, molecular thermodynamic is known to be NP-hard. For the sake of achieving the lower and similar melting temperature for each DNA sequence, we proposed a DNA sequence coding method based on Bacterial Foraging Algorithm (BFA). An evaluation criterion is particularly proposed to assess the quality of DNA sequence in the optimization process. With BFA, high-quality DNA strands are replicated to avoid the participation of inferior strands in the operation. Experiments show our proposed approach significantly outperforms existing methods in terms of continuity and melting temperature.\",\"PeriodicalId\":326530,\"journal\":{\"name\":\"Proceedings of the 5th International Conference on Bioinformatics Research and Applications\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 5th International Conference on Bioinformatics Research and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3309129.3309147\",\"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 Bioinformatics Research and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3309129.3309147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
DNA Computing Sequence Design Based on Bacterial Foraging Algorithm
Since the quantity and quality of DNA sequence directly affect the accuracy and efficiency of computation, the design of DNA sequence is critical to DNA computing. In order to improve the reliability of DNA computing, there is a rich literature targeting at making DNA sequences specifically hybridize at a lower melting temperature, no non-complementary bases pairs or mismatch hybridization in the reformed double helix. However, most of them are not good enough to control the melting temperature, because DNA sequence design problem under the constraints of hamming distance, secondary structure, molecular thermodynamic is known to be NP-hard. For the sake of achieving the lower and similar melting temperature for each DNA sequence, we proposed a DNA sequence coding method based on Bacterial Foraging Algorithm (BFA). An evaluation criterion is particularly proposed to assess the quality of DNA sequence in the optimization process. With BFA, high-quality DNA strands are replicated to avoid the participation of inferior strands in the operation. Experiments show our proposed approach significantly outperforms existing methods in terms of continuity and melting temperature.