Constraining DNA sequences with a triplet-bases unpaired
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 …
burgeoning research field that holds promise for many applications. The accuracy of DNA …
An improved non-dominated sorting genetic algorithm-II (INSGA-II) applied to the design of DNA codewords
Y Wang, Y Shen, X Zhang, G Cui, J Sun - Mathematics and Computers in …, 2018 - Elsevier
DNA codewords design is critical for many research fields, from DNA computing, to DNA
hybridization arrays, to DNA nanotechnology. Results in the literature rely on a wide variety …
hybridization arrays, to DNA nanotechnology. Results in the literature rely on a wide variety …
Biomolecular computing and programming
Molecular computing is a discipline that aims at harnessing individual molecules at
nanoscales for computational purposes. The best-studied molecules for this purpose to date …
nanoscales for computational purposes. The best-studied molecules for this purpose to date …
IWO algorithm based on niche crowding for DNA sequence design
The design of DNA sequences is essential for the implementation of DNA computing, where
the quantity and quality can directly affect the accuracy and efficiency of calculations. Many …
the quantity and quality can directly affect the accuracy and efficiency of calculations. Many …
A BPSON algorithm applied to DNA codes design
DNA computing proposed by Adelman is new biotechnology which provides a new way to
solve NP-hard problem. It has a promising future and successful results of various …
solve NP-hard problem. It has a promising future and successful results of various …
DNA word set design based on minimum free energy
The problem of data and information encoding on DNA bears an increasing interest for both
biological and nonbiological applications of biomolecular computing. Recent experimental …
biological and nonbiological applications of biomolecular computing. Recent experimental …
DNA sequences under multiple guanine-cytosine (GC) base pairs constraint
X Yang, C Zhou - IEEE Transactions on NanoBioscience, 2023 - ieeexplore.ieee.org
DNA computing is a new computing method that has high efficiency in solving large-scale
nonlinear and Non-deterministic Polynomial complete problems. The design of DNA …
nonlinear and Non-deterministic Polynomial complete problems. The design of DNA …
[PDF][PDF] 犇犖犃计算机原理, 进展及难点(Ⅲ): 分子生物计算中的数据结构与特性
许进, 张社民, 范月科, 郭养安 - 计算机学报, 2007 - cjc.ict.ac.cn
摘要分子生物计算是指以生物大分子作为数据来进行信息处理的计算模式. 目前的分子生物计算
主要包含DNA 计算, RNA 计算和蛋白质计算这三种计算模型. 另外, 还有一些学者提出采用PNA …
主要包含DNA 计算, RNA 计算和蛋白质计算这三种计算模型. 另外, 还有一些学者提出采用PNA …
Research on the DNA sequence design based on GA/PSO algorithms
The core reaction of DNA computing is the specific hybridization, which may results in
incorrect or undesirable computations. Therefore, so far much works have focused on …
incorrect or undesirable computations. Therefore, so far much works have focused on …
The optimization of DNA encodings based on GA/SA algorithms
The design of DNA sequence plays an important role in improving the reliability of DNA
computation. Proper constrained terms that DNA sequence should satisfy are selected, and …
computation. Proper constrained terms that DNA sequence should satisfy are selected, and …