東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Topics in parallel computation and m...

Davila, Jaime.

Linked to FindBook

Google Book

Amazon

博客來

Topics in parallel computation and motif discovery in bioinformatics.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Topics in parallel computation and motif discovery in bioinformatics./
Author:	Davila, Jaime.
Description:	90 p.
Notes:	Source: Dissertation Abstracts International, Volume: 68-06, Section: B, page: 3889.
Contained By:	Dissertation Abstracts International68-06B.
Subject:	Biology, Bioinformatics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3269487
ISBN:	9780549085119

Topics in parallel computation and motif discovery in bioinformatics.
Davila, Jaime.

Topics in parallel computation and motif discovery in bioinformatics. - 90 p.

Source: Dissertation Abstracts International, Volume: 68-06, Section: B, page: 3889.

Thesis (Ph.D.)--University of Connecticut, 2007.

The following thesis addresses three problems that involve the design of algorithms which solve the following problems: (1) Routing, Selection and specific versions of Sorting in a parallel model called the Partitioned Optical Passive Star Network (POPS). The algorithms which are proposed are time optimal or near time optimal and involve the use of randomization techniques. (2) The Planted (l, d) Motif Problem. This problem arises in the context of searching transcription factor binding sites in genomic information. Our algorithms address practical and challenging instances of such problem. We implement these ideas and show that they perform better in practice when compared with already existing methods. (3) The Specific Selection Problem. This problem arises in the bioinformatics context, trying to select siRNA sequences in complete mRNA information, such that they minimize off-target hybridization. We propose and implement algorithms that address practical instances of such a problem and that achieve significant speedup over existing approaches.

ISBN: 9780549085119Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

Topics in parallel computation and motif discovery in bioinformatics.
LDR:01853nam 2200253 a 45 001 943109
005 20110520
008 110520s2007 ||||||||||||||||| ||eng d
020 $a 9780549085119
035 $a (UMI)AAI3269487
035 $a AAI3269487
040 $a UMI $c UMI
100 1 $a Davila, Jaime. $3 1267149
245 1 0 $a Topics in parallel computation and motif discovery in bioinformatics.
300 $a 90 p.
500 $a Source: Dissertation Abstracts International, Volume: 68-06, Section: B, page: 3889.
502 $a Thesis (Ph.D.)--University of Connecticut, 2007.
520 $a The following thesis addresses three problems that involve the design of algorithms which solve the following problems: (1) Routing, Selection and specific versions of Sorting in a parallel model called the Partitioned Optical Passive Star Network (POPS). The algorithms which are proposed are time optimal or near time optimal and involve the use of randomization techniques. (2) The Planted (l, d) Motif Problem. This problem arises in the context of searching transcription factor binding sites in genomic information. Our algorithms address practical and challenging instances of such problem. We implement these ideas and show that they perform better in practice when compared with already existing methods. (3) The Specific Selection Problem. This problem arises in the bioinformatics context, trying to select siRNA sequences in complete mRNA information, such that they minimize off-target hybridization. We propose and implement algorithms that address practical instances of such a problem and that achieve significant speedup over existing approaches.
590 $a School code: 0056.
650 4 $a Biology, Bioinformatics. $3 1018415
650 4 $a Computer Science. $3 626642
690 $a 0715
690 $a 0984
710 2 $a University of Connecticut. $3 1017435
773 0 $t Dissertation Abstracts International $g 68-06B.
790 $a 0056
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3269487