東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Surface-based DNA computations.

Su, Xingping.

FindBook

Google Book

Amazon

博客來

Surface-based DNA computations.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Surface-based DNA computations./
作者:	Su, Xingping.
面頁冊數:	71 p.
附註:	Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4000.
Contained By:	Dissertation Abstracts International65-08B.
標題:	Chemistry, Analytical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3143122
ISBN:	0496010921

Surface-based DNA computations.
Su, Xingping.

Surface-based DNA computations. - 71 p.

Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4000.

Thesis (Ph.D.)--The University of Wisconsin - Madison, 2004.

This thesis is focused on the demonstration of the universality of surface-based DNA computers.

ISBN: 0496010921Subjects--Topical Terms:

586156
Chemistry, Analytical.

Surface-based DNA computations.
LDR:02183nmm 2200313 4500 001 1846774
005 20051103093546.5
008 130614s2004 eng d
020 $a 0496010921
035 $a (UnM)AAI3143122
035 $a AAI3143122
040 $a UnM $c UnM
100 1 $a Su, Xingping. $3 1934870
245 1 0 $a Surface-based DNA computations.
300 $a 71 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4000.
500 $a Supervisor: Lloyd M. Smith.
502 $a Thesis (Ph.D.)--The University of Wisconsin - Madison, 2004.
520 $a This thesis is focused on the demonstration of the universality of surface-based DNA computers.
520 $a A fundamental concept in Computer Science is that of the Universal Turing Machine, which is an abstract definition of a general-purpose computer. A general-purpose (universal) computer is defined as one which can compute anything that is computable. It has been shown that any computer which is able to simulate Boolean logic circuits of any complexity is such a general-purpose computer.
520 $a The field of DNA computing was founded in 1994 by Adleman's solution of a 7-bit instance of the Hamiltonian Path problem. This work, as well as most of the subsequent experimental and theoretical investigation in the area, focused primarily upon the solution of NP-complete problems, which are a subset of the larger universal class of problems.
520 $a In the present work a surface DNA computer capable of simulating Boolean logic circuits is demonstrated. This was done by constructing NOR and OR gates and combining them into a simple logic circuit. The NOR gate is one of the universal gates in Boolean logic, meaning that any other logic gate can be built from it alone. The circuit was solved by using DNA-based operations, demonstrating the universal nature of this surface DNA computing model.
590 $a School code: 0262.
650 4 $a Chemistry, Analytical. $3 586156
650 4 $a Computer Science. $3 626642
690 $a 0486
690 $a 0984
710 2 0 $a The University of Wisconsin - Madison. $3 626640
773 0 $t Dissertation Abstracts International $g 65-08B.
790 1 0 $a Smith, Lloyd M., $e advisor
790 $a 0262
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3143122