A molecular solution for minimum vertex cover problem in tile assembly model-Reference-Cited by-同舟云学术

A molecular solution for minimum vertex cover problem in tile assembly model

Published:2013-03-16 Issue:1 Volume:66 Page:148-169
ISSN:0920-8542
Container-title:The Journal of Supercomputing
language:en
Short-container-title:J Supercomput

Author:

Wu Fan,Li Kenli,Sallam Ahmed,Zhou Xu

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Information Systems,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s11227-013-0892-0.pdf

Reference19 articles.

1. Feynman RP (1961) There’s plenty of room at the bottom. In: Gilbert HD (ed) Miniaturization. Reinhold, New York, pp 282–296

2. Head T, Rozenberg G, Bladergroen RB et al (2000) Computing with DNA by operating on plasmids. BioSystems 57:87–93

3. Lipton RJ (1995) DNA solution of hard computational problem. Science 268(4):542–545

4. Xu J, Tan G, Fan Y et al (2007) DNA computer principle, advances and difficulties (IV): on the models of DNA computer [J]. Chin J Comput 30(6):881–893

5. Winfree E et al (1998) Design and self-assembly of two-dimensional DNA crystals. Nature 394:539–544

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Accelerating Vertex Cover Optimization on a GPU Architecture;2018 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID);2018-05

2. The Algorithms of Weightening Based on DNA Sticker Model;Communications in Computer and Information Science;2018

3. Model Checking Temporal Logic Formulas Using Sticker Automata;BioMed Research International;2017

4. On the applicability of Diploid Genetic Algorithms in Vertex Cover Problem;CSI Transactions on ICT;2016-12

5. A Novel Parallel LSA-SVM Algorithm Based on Semantic Distance for Blog;International Journal of Pattern Recognition and Artificial Intelligence;2016-11