東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A DNA approach to the Road-Coloring ...

Roy, Arindam.

FindBook

Google Book

Amazon

博客來

A DNA approach to the Road-Coloring Problem.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	A DNA approach to the Road-Coloring Problem./
作者:	Roy, Arindam.
面頁冊數:	66 p.
附註:	Source: Masters Abstracts International, Volume: 48-03, page: 1676.
Contained By:	Masters Abstracts International48-03.
標題:	Applied Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1478320
ISBN:	9781109554618

A DNA approach to the Road-Coloring Problem.
Roy, Arindam.

A DNA approach to the Road-Coloring Problem. - 66 p.

Source: Masters Abstracts International, Volume: 48-03, page: 1676.

Thesis (M.S.)--The University of Texas - Pan American, 2009.

The Road-Coloring Problem in graph theory can be stated as follows: Is any irreducible aperiodic directed graph with constant outdegree 2 road-colorable? In other words, does such a graph have a synchronizing instruction? That is to say: can we label (or color) the two outgoing edges at each vertex, one with "b" or blue color and the other with "r" or red color, in such a manner that there will be an instruction in the form of a finite sequence in "b"s and "r"s (example: rrbrbbbr) such that this instruction will lead each vertex to the same "target" vertex?

ISBN: 9781109554618Subjects--Topical Terms:

1669109
Applied Mathematics.

A DNA approach to the Road-Coloring Problem.
LDR:01950nam 2200289 4500 001 1403090
005 20111108080416.5
008 130515s2009 ||||||||||||||||| ||eng d
020 $a 9781109554618
035 $a (UMI)AAI1478320
035 $a AAI1478320
040 $a UMI $c UMI
100 1 $a Roy, Arindam. $3 1682332
245 1 2 $a A DNA approach to the Road-Coloring Problem.
300 $a 66 p.
500 $a Source: Masters Abstracts International, Volume: 48-03, page: 1676.
500 $a Adviser: Aruanava Mukherjea.
502 $a Thesis (M.S.)--The University of Texas - Pan American, 2009.
520 $a The Road-Coloring Problem in graph theory can be stated as follows: Is any irreducible aperiodic directed graph with constant outdegree 2 road-colorable? In other words, does such a graph have a synchronizing instruction? That is to say: can we label (or color) the two outgoing edges at each vertex, one with "b" or blue color and the other with "r" or red color, in such a manner that there will be an instruction in the form of a finite sequence in "b"s and "r"s (example: rrbrbbbr) such that this instruction will lead each vertex to the same "target" vertex?
520 $a This thesis is concerned with writing a DNA algorithm which can be followed in the laboratory to produce an explicit solution of a given Road-Coloring problem. This kind of DNA approach was first introduced by Adleman to find an effective method of finding the solution of a given Hamiltonian Path Problem. The Road-Coloring Problem, though introduced over 30 years ago in 1977 by Adler, Goodwyn, and Weiss was only recently solved by Trahtman. But his solution does not give explicitly the synchronizing instruction.
590 $a School code: 6240.
650 4 $a Applied Mathematics. $3 1669109
650 4 $a Biology, Bioinformatics. $3 1018415
690 $a 0364
690 $a 0715
710 2 $a The University of Texas - Pan American. $3 1019447
773 0 $t Masters Abstracts International $g 48-03.
790 1 0 $a Mukherjea, Aruanava, $e advisor
790 $a 6240
791 $a M.S.
792 $a 2009
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1478320