Computational approaches to identifying transcription factor binding sites in yeast genome

摘要: Publisher Summary This chapter describes the basic ideas behind some of algorithms. In yeast genome, there are an estimated 500-600 transcription factors. The targets these factors can range from a few to hundred genes. Typically upstream region gene includes binding sites different that control expression under conditions. Thus, on genomic scale, transcriptional regulation has huge combinatorial complexity and identification regulatory is very challenging problem. Several approaches have been developed tackle this One commonly used approach delineate as sharply possible group coregulated genes search for common sequence patterns in their regions. computational algorithms finding overrepresented substrings or regular multiple local alignment. prerequisite class cleanly defined subset may share motifs. representatives category. An alternative motifs large collection sequences without need defining groups. also two category developed. algorithm based mathematical model probabilistic segmentation, generalization segmentation models statistical language processing. Another identifies promoter regions strongly correlate with genome-wide data.