dna自组装计算模型求解二部图完美匹配问题 the dna self-assembly computing model for solving perfect matching problem of bipartite graph.pdfVIP
- 1、本文档共11页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
dna自组装计算模型求解二部图完美匹配问题 the dna self-assembly computing model for solving perfect matching problem of bipartite graph
DOI :10 .7544/issn1000‐1239 .2016
Journal of Computer Research and Development 53(11):2583 2593 ,2016
( 430074)
(lanwenfei1@ 163 .com )
‐
Lan Wenfei ,Xing Zhibao , Huang Jun ,and Qiang Xiaoli
( , ‐ , 430074)
Biological systems are far more complex and robust than systems we can engineer today ,
and Because of its advantages of stability and specificity , DNA molecules have been used for the
construction of nano‐scale structures .With the development of DNA molecule self‐assembly strategy ,
lots of programmable DNA tiles are constructed and used for solving NP problems .The tile assembly
model ,a formal model of crystal grow th , is a highly distributed parallel model of nature ’s self‐
assembly with the traits of highly distributed parallel , massive storage density and low power
consumption .In the system ,a function can be computed by deterministic assembly and identified two
important quantities : the number of tile types and the assembly speed of the computation . Here a
DNA self‐assembly model for perfect matching problem of bipartite graph is demonstrated ,and a 10‐
vertices bipartite graph is used as an example to illustrate this model . The computation is
nondeterministic and each parallel assembly is executed in time linear in the input .The result show s
that the successful solutions can be found among the many parallel assemblies ,and it requires only a
constant number of different tile types :14 .
erfect matching ;bipartite graph ;DNA computing ;self‐assembly ;tile
p
,DNA .,
10 ,DNA
DNA Tile 、 ;,
;,DNA
.:14 Tile .
;;DNA ;;
TP301 .6
- - - -
:2015 04 22 ;:2016 04 28
:;(CZZ13003 );2015
This work was suppo
您可能关注的文档
- android系统下空情仿真软件的设计与实现 design and implementation of air intelligence simulation.pdf
- android在数字集群通信终端中的应用 application of android in digital trunked radio communication terminal.pdf
- aodv协议路由维护改进方案 an improved method for route maintenance of aodv routing protocol.pdf
- aomdv多路径协议的研究和改进 study and improvement of aomdv multipath protocol.pdf
- android手机趣味app开发之账号信息管理.pdf
- au-ni酪氨酸酶修饰生物传感器检定bpa determination of bpa using au-nityrosinase modified biosensor.pdf
- b2c环境下带预约时间的车辆路径问题及多目标优化蚁群算法 vehicle routing problem with time reservation under b2c electronic commerce and ant colony algorithm for multi-objective optimization.pdf
- bacillus fordii mh602海因酶序列及同源建模分析 analysis of the sequence and homology modeling from bacillus fordii mh602.pdf
- barnase早期热变性位点的动力学模拟研究 early denaturation sites in thermal unfolding of barnase as revealed by molecular dynamics simulation.pdf
- bar-bgp基于备份通告和恢复转发的可靠域间路由 bar-bgp achieving high reliability interdomain routing through backup asaddress advertisement and recovery forwarding.pdf
文档评论(0)