0-1規(guī)劃問題的DNA計(jì)算
0-1 planning problem based on DNA computing
-
摘要: DNA計(jì)算是解決一類難以計(jì)算問題的一種新方法,這種計(jì)算隨著問題的增大可以呈指數(shù)增長(zhǎng)。迄今為止,許多研究成果已經(jīng)成功地提高了它的性能和增加了它的可行性,該文提出了在基于表面的DNA計(jì)算中采用了熒光標(biāo)記策略,解決簡(jiǎn)單的0-1規(guī)劃問題的一種理論方案,嘗試了DNA計(jì)算在規(guī)劃問題中的應(yīng)用。這種方法具有編碼簡(jiǎn)單、耗材底、操作時(shí)間短、技術(shù)先進(jìn)等優(yōu)點(diǎn)。Abstract: DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. In this paper, a theoretical scheme of solving 0-1 planning problem with fluorescence labeling technique given and used to apply DNA computing to planning problem. This method has some significant advantages such as simple encoding, low cost, short operating time, etc.
-
L.M. Adleman, Molecular computation of solutions to combinatorial problems, Science, 1994,(266), 1021-1024. ［2］R.J. Lipton, DNA solution of hard computation problem, Science, 1995, (268), 583-585. ［3］Qi Ouyang, et al., DNA solution of the maximal clique problem, Science, 1997, (278), 446-449. ［4］T. Head, et al., Computing with DNA by operating on plasmids, BioSystems, 2000, 57(2), 87-93. ［5］Cukras, et al., A model for RNA based computation (1999), in Proceeding of the Fourth International Meeting on DNA Based Computers, University of Pennsylvania, Philadelphia, PA, USA,1999, 27-37. ［6］Sakamoto, et al., Molecular computation by DNA hairpin formation, Science, 2000, (288), 1223-1226. ［7］Liu Qinhua, et al., DNA computing on surfaces, Nature, 2000, (403), 175-179. ［8］Haoyang Wu, An improved surface-based method for DNA computation, BioSystem, 2001, 59(1),1-5. ［9］J.A. Bondy, U. S. R. Murty, Graph Theory with Applications, London, The Macmillan Press LTD, 1976, 26-98. -
計(jì)量
- 文章訪問數(shù): 2624
- HTML全文瀏覽量: 123
- PDF下載量: 697
- 被引次數(shù): 0
下載:
