![]() (2017) developed a DNA robot that can control DNA to perform specific actions, such as picking and sorting goods in solution. In 2017, researchers used the CRISPR-Cas system ( Shipman et al., 2017) to encode the pixel values of black-and-white images and short films into the genome of living bacterial populations they minimized the technical limitations of the information storage system. ( Rinaudo et al., 2007) announced a breakthrough DNA computer, which can theoretically release anticancer drugs into cancer cells. (2004) made decisions through simple Boolean logic and successfully used RNA interference to construct molecular computing cores in human kidney cells. It has since been widely used to solve problems in many domains, including PCR amplification ( Sze and Schloss, 2019), DNA sequencing ( Shendure et al., 2017), bioinformatics ( Zou and Liu, 2019), prediction of disease genes ( Zeng et al., 2020a, b), image encryption ( Zhou et al., 2020), and DNA data storage ( Zhang et al., 2019 Cao et al., 2021), among others.īenenson et al. The successful solution of this problem led DNA computing to become a field of great development. At the end of the 20th century, Adleman (1994) used DNA molecules for calculation and solved the Hamiltonian problem ( Heidari, 2014). The DNA sequences satisfying the constraint combination obtained the minimum of fitness values and had stable and usable structures.ĭNA computing is a new and promising interdisciplinary subject based on computational science and molecular biology, which shows great potential in solving NP problems ( Wang et al., 2019 Zhu et al., 2020). Compared with other algorithms, among the 23 benchmark functions, the new algorithm obtained the minimum value for one-third of the functions and two-thirds of the current minimum value. ![]() The ICW optimization algorithm is added to a new predator–prey strategy and sine and cosine functions under the action of chaos. To optimize the above problems, the constraints of Pairing Sequences Constraint (PSC) and Close-ending along with the Improved Chaos Whale (ICW) optimization algorithm were proposed to construct a DNA sequence set that satisfies the combination of constraints. In addition, a DNA sequence and its complement follow the principle of complementary pairing, and the sequence of base GC at both ends is more stable. However, the previous optimized DNA sequences reacted with each other, which reduced the number of DNA sequences that could be used for molecular hybridization in the solution and thus reduced the accuracy of DNA computing. ![]() The design of DNA sequences is a multi-objective optimization problem in DNA computing, whose objective is to obtain optimized sequences that satisfy multiple constraints to improve the quality of the sequences. 3College of Computer and Communication Engineering, China University of Petroleum, Qingdao, ChinaĭNA computing is a new method based on molecular biotechnology to solve complex problems.2School of Software, Tsinghua University, Beijing, China.1The Key Laboratory of Advanced Design and Intelligent Computing, Ministry of Education, School of Software Engineering, Dalian University, Dalian, China.Xue Li 1†, Ziqi Wei 2†, Bin Wang 1* and Tao Song 3*
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |