• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用三联碱基未配对来约束 DNA 序列。

Constraining DNA Sequences With a Triplet-Bases Unpaired.

出版信息

IEEE Trans Nanobioscience. 2020 Apr;19(2):299-307. doi: 10.1109/TNB.2020.2971644. Epub 2020 Feb 4.

DOI:10.1109/TNB.2020.2971644
PMID:32031945
Abstract

DNA computing, the combination of computer science and molecular biology, is a burgeoning research field that holds promise for many applications. The accuracy of DNA computing is determined by reliable DNA sequences, the quality of which affects the accuracy of hybridization reactions. Evaluating the sequences obtained from the previous combination constraints in NUPACK for simulation experiments, we find that the concentration of the sequences after entering solution was significantly lower than that before entering solution, which should affect the accuracy of DNA hybridization reactions. Therefore, in this study, we propose a new constraint, a triplet-bases unpaired constraint, which can be combined with other constraints to form a new combination constraint. In addition, we combine the Harmony Search algorithm with the Whale Optimization Algorithm (WOA) to present a new algorithm, termed HSWOA, which we used to design DNA sequences that meet the new combination constraint. Finally, compared with previous findings, our result shows that our algorithm not only improves the efficiency of hybridization reactions but also yields a better fitness value.

摘要

DNA 计算,是计算机科学和分子生物学的结合,是一个新兴的研究领域,在许多应用中具有广阔的前景。DNA 计算的准确性取决于可靠的 DNA 序列,其质量影响杂交反应的准确性。通过对 NUPACK 中之前的组合约束进行模拟实验得到的序列进行评估,我们发现序列进入溶液后的浓度明显低于进入溶液前的浓度,这应该会影响 DNA 杂交反应的准确性。因此,在本研究中,我们提出了一个新的约束条件,即三联体碱基未配对约束条件,它可以与其他约束条件相结合,形成新的组合约束条件。此外,我们将 Harmony Search 算法与鲸鱼优化算法 (WOA) 相结合,提出了一种新的算法,称为 HSWOA,我们使用该算法来设计满足新组合约束条件的 DNA 序列。最后,与之前的研究结果相比,我们的结果表明,我们的算法不仅提高了杂交反应的效率,而且还获得了更好的适应度值。

相似文献

1
Constraining DNA Sequences With a Triplet-Bases Unpaired.用三联碱基未配对来约束 DNA 序列。
IEEE Trans Nanobioscience. 2020 Apr;19(2):299-307. doi: 10.1109/TNB.2020.2971644. Epub 2020 Feb 4.
2
Stable DNA Sequence Over Close-Ending and Pairing Sequences Constraint.封闭末端和配对序列约束下的稳定DNA序列
Front Genet. 2021 May 17;12:644484. doi: 10.3389/fgene.2021.644484. eCollection 2021.
3
H-ACO with Consecutive Bases Pairing Constraint for Designing DNA Sequences.用于设计DNA序列的具有连续碱基配对约束的H-ACO
Interdiscip Sci. 2024 Sep;16(3):593-607. doi: 10.1007/s12539-024-00614-1. Epub 2024 Apr 29.
4
Improved Bare Bones Particle Swarm Optimization for DNA Sequence Design.改进的基本粒子群算法在 DNA 序列设计中的应用。
IEEE Trans Nanobioscience. 2023 Jul;22(3):603-613. doi: 10.1109/TNB.2022.3220795. Epub 2023 Jun 29.
5
DNA Sequences Under Multiple Guanine-Cytosine (GC) Base Pairs Constraint.受多重鸟嘌呤-胞嘧啶(GC)碱基对约束的 DNA 序列。
IEEE Trans Nanobioscience. 2024 Apr;23(2):252-261. doi: 10.1109/TNB.2023.3316431. Epub 2024 Mar 28.
6
IWO Algorithm Based on Niche Crowding for DNA Sequence Design.基于小生境拥挤的IWO算法用于DNA序列设计
Interdiscip Sci. 2017 Sep;9(3):341-349. doi: 10.1007/s12539-016-0160-0. Epub 2016 Mar 25.
7
A DNA solution of SAT problem by a modified sticker model.一种基于改进贴纸模型的SAT问题的DNA解决方案。
Biosystems. 2005 Jul;81(1):1-9. doi: 10.1016/j.biosystems.2005.01.001. Epub 2005 Feb 10.
8
EGNAS: an exhaustive DNA sequence design algorithm.EGNAS:一种详尽的 DNA 序列设计算法。
BMC Bioinformatics. 2012 Jun 20;13:138. doi: 10.1186/1471-2105-13-138.
9
A CLIQUE algorithm using DNA computing techniques based on closed-circle DNA sequences.一种基于闭环DNA序列的使用DNA计算技术的CLIQUE算法。
Biosystems. 2011 Jul;105(1):73-82. doi: 10.1016/j.biosystems.2011.03.004. Epub 2011 Apr 12.
10
Improving the efficiency of a user-driven learning system with reconfigurable hardware. Application to DNA splicing.利用可重构硬件提高用户驱动学习系统的效率。在DNA剪接中的应用。
Pac Symp Biocomput. 1999:290-301. doi: 10.1142/9789814447300_0029.

引用本文的文献

1
A multi-objective path optimization method for plant protection robots based on improved A*-IWOA.一种基于改进A*-IWOA的植保机器人多目标路径优化方法
PeerJ Comput Sci. 2024 Dec 20;10:e2620. doi: 10.7717/peerj-cs.2620. eCollection 2024.
2
Study on DNA Storage Encoding Based IAOA under Innovation Constraints.创新约束下基于IAOA的DNA存储编码研究
Curr Issues Mol Biol. 2023 Apr 18;45(4):3573-3590. doi: 10.3390/cimb45040233.
3
Levy Equilibrium Optimizer algorithm for the DNA storage code set.用于 DNA 存储码集的 Levy 平衡优化器算法。
PLoS One. 2022 Nov 17;17(11):e0277139. doi: 10.1371/journal.pone.0277139. eCollection 2022.
4
Optimization and Predictive Modeling of Reinforced Concrete Circular Columns.钢筋混凝土圆柱的优化与预测建模
Materials (Basel). 2022 Sep 23;15(19):6624. doi: 10.3390/ma15196624.
5
Stable DNA Sequence Over Close-Ending and Pairing Sequences Constraint.封闭末端和配对序列约束下的稳定DNA序列
Front Genet. 2021 May 17;12:644484. doi: 10.3389/fgene.2021.644484. eCollection 2021.
6
CLGBO: An Algorithm for Constructing Highly Robust Coding Sets for DNA Storage.CLGBO:一种用于构建DNA存储高度鲁棒编码集的算法。
Front Genet. 2021 May 4;12:644945. doi: 10.3389/fgene.2021.644945. eCollection 2021.
7
Medical Image Protection Algorithm Based on Deoxyribonucleic Acid Chain of Dynamic Length.基于动态长度脱氧核糖核酸链的医学图像保护算法
Front Genet. 2021 Mar 4;12:654663. doi: 10.3389/fgene.2021.654663. eCollection 2021.
8
A Dynamic DNA Color Image Encryption Method Based on SHA-512.一种基于SHA-512的动态DNA彩色图像加密方法。
Entropy (Basel). 2020 Sep 28;22(10):1091. doi: 10.3390/e22101091.
9
New insights into the existing image encryption algorithms based on DNA coding.基于 DNA 编码的现有图像加密算法的新见解。
PLoS One. 2020 Oct 23;15(10):e0241184. doi: 10.1371/journal.pone.0241184. eCollection 2020.
10
A disease category feature database construction method of brain image based on deep convolutional neural network.基于深度卷积神经网络的脑影像疾病类别特征数据库构建方法。
PLoS One. 2020 Jun 1;15(6):e0232791. doi: 10.1371/journal.pone.0232791. eCollection 2020.