東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Towards a complete transcriptional r...

Narlikar, Leelavati.

FindBook

Google Book

Amazon

博客來

Towards a complete transcriptional regulatory code: Improved motif discovery using informative priors.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Towards a complete transcriptional regulatory code: Improved motif discovery using informative priors./
作者:	Narlikar, Leelavati.
面頁冊數:	247 p.
附註:	Adviser: Alexander J. Hartemink.
Contained By:	Dissertation Abstracts International69-03B.
標題:	Biology, Bioinformatics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3297869
ISBN:	9780549492023

Towards a complete transcriptional regulatory code: Improved motif discovery using informative priors.
Narlikar, Leelavati.

Towards a complete transcriptional regulatory code: Improved motif discovery using informative priors. - 247 p.

Adviser: Alexander J. Hartemink.

Thesis (Ph.D.)--Duke University, 2008.

All our priors significantly outperform conventional methods, finding motifs matching literature for 52 TFs. We produce a genome-wide map of TF binding sites in yeast based on these and other novel motif predictions.

ISBN: 9780549492023Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

Towards a complete transcriptional regulatory code: Improved motif discovery using informative priors.
LDR:03609nam 2200337 a 45 001 963044
005 20110830
008 110831s2008 ||||||||||||||||| ||eng d
020 $a 9780549492023
035 $a (UMI)AAI3297869
035 $a AAI3297869
040 $a UMI $c UMI
100 1 $a Narlikar, Leelavati. $3 1286104
245 1 0 $a Towards a complete transcriptional regulatory code: Improved motif discovery using informative priors.
300 $a 247 p.
500 $a Adviser: Alexander J. Hartemink.
500 $a Source: Dissertation Abstracts International, Volume: 69-03, Section: B, page: 1745.
502 $a Thesis (Ph.D.)--Duke University, 2008.
520 $a All our priors significantly outperform conventional methods, finding motifs matching literature for 52 TFs. We produce a genome-wide map of TF binding sites in yeast based on these and other novel motif predictions.
520 $a Transcriptional regulation is the primary mechanism employed by the cell to ensure coordinated expression of its numerous genes. A key component of this process is the binding of proteins called transcription factors (TFs) to corresponding regulatory sites on the DNA. Understanding where exactly these TFs bind, under what conditions they are active, and which genes they regulate is all part of deciphering the transcriptional regulatory code. An important step towards solving this problem is the identification of DNA binding specificities, represented as motifs, for all TFs. In spite of an explosion of TF binding data from high-throughput technologies, the problem of motif discovery remains unsolved, due to the short length and degeneracy of binding sites.
520 $a We introduce PRIORITY, a Gibbs sampling-based approach, which incorporates informative positional priors into a probabilistic framework, to find significant motifs from high-throughput TF binding data. We use different data sources to build our positional priors and apply them to yeast ChIP-chip data: (1) TFs can be classified into several structural classes based on their DNA-binding domains. Using a Bayesian learning algorithm, we show that it is possible to predict the class of a TF with remarkable accuracy, using information solely from its DNA binding sites. We further incorporate these results in the form of informative priors into PRIORITY, which learns the structural class of the TF in addition to its motif. (2) In the nucleus, DNA is present in the form of chromatin---wrapped around nucleosomes---with certain regions being more accessible to TFs than others. It has been shown that functional binding sites are generally located in nucleosome-free regions. We use nucleosome occupancy predictions to compute a novel positional prior that biases the search towards the more accessible regions, thereby enriching the motif signal. (3) Functional elements are often conserved across related species. Most conventional methods that exploit this fact use alignments. However, multiple alignments cannot always capture relocation and reversed orientation of binding sites across species. We propose a new alignment-free technique that not only accounts for these transformations, but is much faster than conventional methods.
590 $a School code: 0066.
650 4 $a Biology, Bioinformatics. $3 1018415
650 4 $a Computer Science. $3 626642
690 $a 0715
690 $a 0984
710 2 $a Duke University. $b Computer Science. $3 1019283
773 0 $t Dissertation Abstracts International $g 69-03B.
790 $a 0066
790 1 0 $a Hartemink, Alexander J., $e advisor
790 1 0 $a Magwene, Paul $e committee member
790 1 0 $a Ohler, Uwe $e committee member
790 1 0 $a Tomasi, Carlo $e committee member
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3297869