Full metadata record
DC FieldValueLanguage
dc.contributor.authorZaslavsky, Elena-
dc.date.accessioned2007-12-10T01:42:59Z-
dc.date.available2007-12-10T01:42:59Z-
dc.date.issued2006-
dc.identifier.urihttp://ir.vnulib.edu.vn/handle/123456789/1220-
dc.description.abstractA major objective in molecular biology is to understand how a genome encodes the information that speci es when and where a gene will be transcribed into its protein product. Mediating proteins, known as transcription factors, facilitate this process by interacting with the cell 's sDNA and the transcription machinery. It is of central importance to identify all sequence-speci c DNA binding sites of transcription factors. In this thesis, we consider two relevant computational problems. The first problem is to develop a representation for a group of known binding sites of a particular transcription factor, in order to facilitate recognition of other binding sites of the same protein. We evaluate the e ectiveness of several approaches commonly used for this problem, and show that there are statistically signi cant di erences in their performance. We also consider variants of the basic methods that incorporate pairwise nucleotide dependencies and per-position information content. We find that the use of per-position information content improves all basic methods, and that including local pairwise nucleotide dependencies within binding site models results in better performance for some approaches. The second problem is that of motif discovery. In this context, given a set of sequences known to contain binding sites of a particular transcription factor, the objective is to identify their locations. We propose a novel combinatorial optimization framework for motif finding, which utilizes both graph pruning techniques and an integer linear programming formulation. Additionally, we introduce a procedure to identify statistically signi cant motifs. We apply our algorithm to numerous biological datasets as well as to synthetic data, and it performs exceptionally well. Furthermore, we show our framework to be versatile and easily applicable to other variants of the DNA binding site identi cation problem such as phylogenetic footprinting, the ‘subtle’ motif formulation and the multiple motifs problem. Studying the optimization framework in greater depth, we introduce a novel, more compact integer linear program that utilizes the discrete nature of the distance metric imposed on pairs of subsequences. We compare the properties of the two alternate formulations from a theoretical perspective and demonstrate that the compact for¬mulation also leads to a method that is highly eective in practice.-
dc.language.isoen_US
dc.publisherPrinceton University
dc.relation.ispartofseriesDoctor of Philosophy
dc.subjectSinh học phân tử
dc.subjectDNA-
dc.titleAlgorithms for Representation and Discovery of Transcription Factor Binding Sites
Appears in Collections
CL – ProQuest


  • 3198051.PDF
    • Size : 994,69 kB

    • Format : Adobe PDF

    • Views : 
    • Downloads :