東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Optimal methods of encoding informat...

The University of Western Ontario (Canada).

Linked to FindBook

Google Book

Amazon

博客來

Optimal methods of encoding information for DNA computing.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Optimal methods of encoding information for DNA computing./
Author:	Losseva, Elena.
Description:	132 p.
Notes:	Source: Dissertation Abstracts International, Volume: 68-09, Section: B, page: 6076.
Contained By:	Dissertation Abstracts International68-09B.
Subject:	Biology, Bioinformatics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR30724
ISBN:	9780494307243

Optimal methods of encoding information for DNA computing.
Losseva, Elena.

Optimal methods of encoding information for DNA computing. - 132 p.

Source: Dissertation Abstracts International, Volume: 68-09, Section: B, page: 6076.

Thesis (Ph.D.)--The University of Western Ontario (Canada), 2006.

Keywords: theoretical DNA computing, DNA encodings, codes, language equations, formal languages.

ISBN: 9780494307243Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

Optimal methods of encoding information for DNA computing.
LDR:03277nam 2200313 a 45 001 861195
005 20100719
008 100719s2006 ||||||||||||||||| ||eng d
020 $a 9780494307243
035 $a (UMI)AAINR30724
035 $a AAINR30724
040 $a UMI $c UMI
100 1 $a Losseva, Elena. $3 1028863
245 1 0 $a Optimal methods of encoding information for DNA computing.
300 $a 132 p.
500 $a Source: Dissertation Abstracts International, Volume: 68-09, Section: B, page: 6076.
502 $a Thesis (Ph.D.)--The University of Western Ontario (Canada), 2006.
520 $a Keywords: theoretical DNA computing, DNA encodings, codes, language equations, formal languages.
520 $a This thesis is based on articles [45], [53], third chapter of [28], as well as [48] and [49].
520 $a Biomolecular computing is a field that studies biologically-based computational paradigms alternative to the traditional electronic ones. The strategy of DNA computing is to encode data in DNA strands and to apply molecular biology tools to perform arithmetic and logic operations. We look at the question of managing errors that arise in DNA-based computation, presenting several solutions to the problem of erroneous bio-computations from the perspective of formal language techniques. The objective of the thesis is the investigation of optimal methods of encoding information in DNA in a way that reduces errors associated with DNA computing.
520 $a The DNA strands used for computation need to have certain characteristics in order to avoid data loss and erroneous results. One source of problems comes from DNA code segments attaching to each other in unexpected ways and, as a result, making them unsuitable for computation. In this thesis we analyze the properties that guard against such phenomena and study the sets of sequences that ensure that no unwanted bindings occur during computation.
520 $a Another contribution of the thesis is the study of mathematical properties of languages used for encoding of data in DNA. Certain biological operations which can be performed on DNA sequences can be mathematically modelled as operations on words. This portion of the thesis is devoted to the study of such word operations and related language equations using formal language theory techniques.
520 $a Another aspect of DNA computing is rooted in the problem of building reliable systems out of unreliable components. Prior to construction of functional and practical computational devices with DNA, it is inevitable that they will be preceded by more simplistic and restricted mechanisms of limited reliability. Discovering how to combine the components of moderate reliability into larger systems with a desired reliability is key to the extension of computing capacity. For this purpose, finite automata can be viewed as an abstraction of a biocomputing process. This thesis investigates the construction of reliable finite automata from component finite automata that do not correctly accept their intended languages.
590 $a School code: 0784.
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 Western Ontario (Canada). $3 1017622
773 0 $t Dissertation Abstracts International $g 68-09B.
790 $a 0784
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR30724