基于粘貼與刪除系統(tǒng)求解最短有向路問題的dna計(jì)算模型

《基于粘貼與刪除系統(tǒng)求解最短有向路問題的dna計(jì)算模型》由會(huì)員上傳分享，免費(fèi)在線閱讀，更多相關(guān)內(nèi)容在學(xué)術(shù)論文-天天文庫。

1、
http://www.paper.edu.cnDNA



11
2
1






!"#$%&'(!)*+,-(./012345'6789,!",:&;<+7=>,?@.ABCDEC%DNAFGHIJK+,-LMNJK.NOP@ABDEC,QRSTU5VWXY!"#$,DNAFGJKZ[;G].
^DNAFGABCDEC!"#$

2、DNAComputingModelforShortestDirectedPathProblemBasedonStickerandDeleteSystemMaFangfang1,WangShudong1,LiHan2,XueShengwei1(1CollegeofInformationScienceandEngineering.ShandongUniversityofScienceandTechnology.Qingdao266510;2CollegeofInformation.ShandongUniversity

3、ofScienceandTechnology.taian271209)Abstract
Shortestdirectedpathproblemisfindingadirectedpathwithminimumweightintwopointedvertexofadirectednetwork.Ithasextensiveapplicationinengineeringpractice.StickersystemanddeletesystemaretwokindsofbasicmodelsinDNAcomputin

4、gformmodel.ThispaperproposedDNAcomputingmodelandbiochemicalproceduresofgraphshortestdirectedpathproblemuseinghighparallelismofstickersystemanddeletesystem.K
e
ywords:
DNAcomputingstickersystemdeletesystemshortestdirectedpathproblem
DN

5、A!"#$%&'()*+,-./012345678DNA9:;<=>?,@AB+CDEFGH56I+JKL56IJKMNO56I+P56Q[1
5]*R'VSTU,
VVWX$Y,ZWSTUV-[]^x,V-_`a&b]^x,c''d

x
x

x
x*L(V),R(V),LR(V)efUghijklimk,himklijk


,nijk-omk<3pmkeqrOs*tW

Vu

Vw1L

V
R

V
LR

V,WK

V*]^
W

6、K

VXmkvwxeq,y-V
w2
w,w
Vzw{w

7、}QcdVVWX$Y
*1~2?€`1<32peqOsW

V-(???-???{…?????‰??1€?~?Y???€*http://www.paper.edu.cng
’xx1x2x3
W

Vy
W

V*x,y~?€@?+‘~?Y?“A>r


V,,A,D,y-VSTU,

VVWX$Y,A


w

LR

V,D
W

V
W

V*XLn

wVLMn

,wV

8、~?Y?
‰
w
??
,y-LMn


w
WK
Vxw,x
Azx
y”?”W
u,v
Dz



y

u,
x,vzx,y
LR
V*x
wUg–x—?,??DV&W/????
u,v?8,
WK

V-3pmkeq*?€?Y???€??=￠{…?????‰&'??*?€￡¤￥@?
R

xuwvyz&|DNAjk,y-qkx,u,w,v,y,z§DNAjkz
{a¨&|DNAjkuv?a,y-uzvefjku,v?,u{u>sv{v>s,??w*8?ˉ

9、°±23′μw?·jkx,y,z?1s2,:o3pmk,???????mk?jkxuvyz*V?€?;
-jkvww*?Y?


V,T,A,R,y-VSTU,T
V,A
V,R-]^à]á
u,
/,v,y


-u,v
V,(V


)(


V)*
u,
/,vUg`V??
u,v-?
,??


u
v
uv*L()


Tx