DNA-based computing
DNA-based computing provides an alternative to solving optimization problems in graph theory. In this research, it is shown how DNA-based computing is used to find solutions to these problems, which involve logical thinking and are often NP hard complete. These include the shortest path, shortest sp...
Saved in:
主要作者: | Yong, Kian Yan |
---|---|
其他作者: | Shu Jian Jun |
格式: | Theses and Dissertations |
語言: | English |
出版: |
2013
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/54896 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Random walks in distributed networks and their applications
由: Anisur Rahaman Molla
出版: (2014) -
Some constructions of (t, m, s)-nets with improved parameters
由: Ling, San, et al.
出版: (2013) -
Dimensional crossover in spin-1 Heisenberg antiferromagnets : a quantum Monte Carlo study
由: Wierschem, Keola, et al.
出版: (2013) -
Ultralow-threshold two-photon pumped amplified spontaneous emission and lasing from seeded CdSe/CdS nanorod heterostructures
由: Xing, Guichuan, et al.
出版: (2013) -
On NP-hardness of the clique partition : independence number gap recognition and related problems
由: Busygin, Stanislav., et al.
出版: (2012)