《dna計(jì)算模型》ppt課件-全文預(yù)覽
【正文】 信息，同一條邊對(duì)應(yīng)的兩個(gè)粘性末端編碼序列互補(bǔ)。 于是我們看到，現(xiàn)在的 DNA計(jì)算，甚至是生物計(jì)算發(fā)展的一個(gè)方向就是改進(jìn)計(jì)算方法，縮減候選解集的規(guī)模，改進(jìn)編碼方式使其能以更短的長(zhǎng)度解決問題，這還有賴于分子生物學(xué)技術(shù)的進(jìn)步。 ? 其與傳統(tǒng)的進(jìn)化算法相比，一方面 DNA進(jìn)化算法的可以實(shí)現(xiàn)更大的群體規(guī)模；另一方面隨著群體規(guī)模的增大， DNA計(jì)算的并行性不會(huì)導(dǎo)致搜索時(shí)間的增加。 參考文獻(xiàn) [1]張成 , 楊靜 , 王淑棟 . DNA計(jì)算中熒光技術(shù)的應(yīng)用及其發(fā)展 [J].計(jì)算機(jī)學(xué)報(bào) , 2022, 32(12):23002310. [2]孫偉 , 尤加宇 , 江宏 , 等 . 納米粒子標(biāo)記 DNA 探針的制備與檢測(cè)應(yīng)用 [J]. 中國(guó)衛(wèi)生檢驗(yàn)雜志 , 2022, 15( 8): 1008. [3] Rohani Binti Abu Bakar,Junzo Watada, Witold Pedrycz. DNA approach to solve clustering problem based on a mutual order[J]. BioSystems. 2022, 91: 112. [4] Rohani Binti Abu Bakar,Junzo Watada, A Biologically Inspired Computing Approach to Solve ClusterBased Determination of Logistic Problem[J]. Biomedical Soft Computing and Human Sciences, 2022, 13(2): 5966. [5] Xiaolong Wang, Zhenmin Bao, Jingjie Hu, Shi Wang, Aibin Zhan. Solving the SAT problem using a DNA puting algorithm based on ligase chain reaction[J]. BioSystems. 2022, 91: 117–125. [6] Sam Roweis. Eric Winfree, Richard Burgoyng. Nickolas, V. Chelyapov, Myron, . Paul . Rothemund, and Leonard M. A dleman. A StickerBased Model for DNA Computation[J]. Computational Biology, 1998(5): 615629. [7] Carlos Alberto Alonso Sanches , Nei Yoshihiro Soma. A polynomialtime DNA puting solution for the BinPacking Problem[J]. Applied Mathematics and Computation. 2022, 215: 2055–2062. [8] Sakamato K,Gouzu H,Kiga D, Yokoyama S, Yokomori T, Hagiya putation by DNA hairpin form
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號(hào)-1