東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Memory systems for DNA computers.

The University of Memphis.

FindBook

Google Book

Amazon

博客來

Memory systems for DNA computers.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Memory systems for DNA computers./
作者:	Neel, Andrew J.
面頁冊數:	146 p.
附註:	Adviser: Max H. Garzon.
Contained By:	Dissertation Abstracts International68-08B.
標題:	Biology, Bioinformatics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3276723
ISBN:	9780549186069

Memory systems for DNA computers.
Neel, Andrew J.

Memory systems for DNA computers. - 146 p.

Adviser: Max H. Garzon.

Thesis (Ph.D.)--The University of Memphis, 2007.

Recent work has proven DNA computing to be a powerful tool for solving very hard problems like the Hamiltonian Path (Traveling Salesman) Problem. This work has spawned a new research field, called DNA computing, to study in depth novel applications of this new medium. One recent motivator in this field has been to replace silicon based computers for certain applications with DNA-based computers. My theme is basic research to provide these DNA computers with suitable memories. I present substantial evidence that DNA memories can reliably store data in such a way that information can be retrieved associatively and semantically. The massively parallel nature of DNA lends a means of retrieval that is very fast (order of minutes) by current biotechnologies. DNA memories were prototyped and evaluated on two challenging problems in silico using EdnaCo, a virtual test tube simulator. Specifically, DNA memories successfully retrieved solutions for the problems of Recognizing Textual Entailment (RTE) by simple methods that perform competitively with far subtler lexical methods; they also distinguished genomes of biological organisms without significant prior classification effort. The capacity of DNA memories is shown to be at least as dense as that of Hopfield Memory, the standard associative memory benchmark implemented with Neural Networks. The contribution of this research is designs for DNA memories that are not only capable of solving problems hitherto very challenging to conventional computers, but are feasible to implement with conventional powerful biotechnologies, e.g. DNA chips and microarrays.

ISBN: 9780549186069Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

Memory systems for DNA computers.
LDR:02461nam 2200277 a 45 001 861191
005 20100719
008 100719s2007 ||||||||||||||||| ||eng d
020 $a 9780549186069
035 $a (UMI)AAI3276723
035 $a AAI3276723
040 $a UMI $c UMI
100 1 $a Neel, Andrew J. $3 1028859
245 1 0 $a Memory systems for DNA computers.
300 $a 146 p.
500 $a Adviser: Max H. Garzon.
500 $a Source: Dissertation Abstracts International, Volume: 68-08, Section: B, page: 5365.
502 $a Thesis (Ph.D.)--The University of Memphis, 2007.
520 $a Recent work has proven DNA computing to be a powerful tool for solving very hard problems like the Hamiltonian Path (Traveling Salesman) Problem. This work has spawned a new research field, called DNA computing, to study in depth novel applications of this new medium. One recent motivator in this field has been to replace silicon based computers for certain applications with DNA-based computers. My theme is basic research to provide these DNA computers with suitable memories. I present substantial evidence that DNA memories can reliably store data in such a way that information can be retrieved associatively and semantically. The massively parallel nature of DNA lends a means of retrieval that is very fast (order of minutes) by current biotechnologies. DNA memories were prototyped and evaluated on two challenging problems in silico using EdnaCo, a virtual test tube simulator. Specifically, DNA memories successfully retrieved solutions for the problems of Recognizing Textual Entailment (RTE) by simple methods that perform competitively with far subtler lexical methods; they also distinguished genomes of biological organisms without significant prior classification effort. The capacity of DNA memories is shown to be at least as dense as that of Hopfield Memory, the standard associative memory benchmark implemented with Neural Networks. The contribution of this research is designs for DNA memories that are not only capable of solving problems hitherto very challenging to conventional computers, but are feasible to implement with conventional powerful biotechnologies, e.g. DNA chips and microarrays.
590 $a School code: 1194.
650 4 $a Biology, Bioinformatics. $3 1018415
650 4 $a Computer Science. $3 626642
690 $a 0715
690 $a 0984
710 2 $a The University of Memphis. $3 1025952
773 0 $t Dissertation Abstracts International $g 68-08B.
790 $a 1194
790 1 0 $a Garzon, Max H., $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3276723