東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

The implementation of a DNA computer...

Johnson, Clifford R.

Linked to FindBook

Google Book

Amazon

博客來

The implementation of a DNA computer to solve n-variable 3 CNF SAT problems.

Record Type:	Electronic resources : Monograph/item
Title/Author:	The implementation of a DNA computer to solve n-variable 3 CNF SAT problems./
Author:	Johnson, Clifford R.
Description:	129 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-07, Section: B, page: 3306.
Contained By:	Dissertation Abstracts International65-07B.
Subject:	Biology, Molecular. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3140487
ISBN:	0496876287

The implementation of a DNA computer to solve n-variable 3 CNF SAT problems.
Johnson, Clifford R.

The implementation of a DNA computer to solve n-variable 3 CNF SAT problems. - 129 p.

Source: Dissertation Abstracts International, Volume: 65-07, Section: B, page: 3306.

Thesis (Ph.D.)--University of Southern California, 2004.

It has been a decade since the first molecular computation was performed. It was shown that DNA molecules can perform very sophisticated, massively parallel computations avoiding the Von Neumann bottleneck. Yet, progress in the field has been slow. The largest problem solved to date is a 20 variable instance of the 3-CNF SAT problem, solved as a part of this thesis. Simply performing the computation took more than two man-weeks to complete because every aspect of the computation was executed by hand.

ISBN: 0496876287Subjects--Topical Terms:

1017719
Biology, Molecular.

The implementation of a DNA computer to solve n-variable 3 CNF SAT problems.
LDR:02957nmm 2200337 4500 001 1846712
005 20051103093539.5
008 130614s2004 eng d
020 $a 0496876287
035 $a (UnM)AAI3140487
035 $a AAI3140487
040 $a UnM $c UnM
100 1 $a Johnson, Clifford R. $3 1934813
245 1 4 $a The implementation of a DNA computer to solve n-variable 3 CNF SAT problems.
300 $a 129 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-07, Section: B, page: 3306.
500 $a Adviser: Michel Baudry.
502 $a Thesis (Ph.D.)--University of Southern California, 2004.
520 $a It has been a decade since the first molecular computation was performed. It was shown that DNA molecules can perform very sophisticated, massively parallel computations avoiding the Von Neumann bottleneck. Yet, progress in the field has been slow. The largest problem solved to date is a 20 variable instance of the 3-CNF SAT problem, solved as a part of this thesis. Simply performing the computation took more than two man-weeks to complete because every aspect of the computation was executed by hand.
520 $a Molecular computations require many laborious steps that will only increase as the scale increases. Automating the process is essential. The next step---that of taking the laborious, bench protocols performed by hand, and automating them---was achieved in this thesis with the construction of the first automated DNA computer, EDNA (for e&barbelow;xperimental DNA a&barbelow;utomated computer). Using a combinatorial DNA library, EDNA was designed to solve instances of the n-variable 3-CNF SAT problem, considered among the hardest of the hard problems for computers to solve. As part of this thesis, a 10 variable instance of the 3-CNF SAT problem was essayed. The computation took 28 hours to perform. EDNA correctly computed nine of the ten variables, with the tenth variable remaining ambiguous. This is comparable to current results in the molecular computation community.
520 $a The thesis research includes: (1) The synthesis of a 20 variable combinatorial library, and a concomitant patent application. (2) The solution of a 6 variable instance of the 3-CNF SAT problem. (3) The solution of a 20 variable instance of the 3-CNF SAT problem. (4) The construction of an automated molecular computer.
520 $a The importance of this research is not only that the work performed as part of this thesis extends the limits of molecular computation. It also clearly demonstrates that under very simple conditions, very sophisticated computational problems can be solved by molecules.
590 $a School code: 0208.
650 4 $a Biology, Molecular. $3 1017719
650 4 $a Computer Science. $3 626642
650 4 $a Biology, Neuroscience. $3 1017680
650 4 $a Biology, Biostatistics. $3 1018416
690 $a 0307
690 $a 0984
690 $a 0317
690 $a 0308
710 2 0 $a University of Southern California. $3 700129
773 0 $t Dissertation Abstracts International $g 65-07B.
790 1 0 $a Baudry, Michel, $e advisor
790 $a 0208
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3140487