Computational analyses of eukaryotic promoters.
Computational analysis of eukaryotic promoters is one of the most difficult problems in computational genomics and is essential for understanding gene expression profiles and reverse-engineering gene regulation network circuits. Here I give a basic introduction of the problem and recent update on both experimental and computational approaches. More details may be found in the extended references. This review is based on a summer lecture given at Max Planck Institute at Berlin in 2005.
Zhang
Michael Q
MQ
Cold Spring Harbor Laboratory, 1 Bungtown Road, Cold Spring Harbor, NY 11724, USA.
D000818:Animals; D002874:Chromosome Mapping / Q000639:trends*; D019295:Computational Biology / Q000639:trends*; D006801:Humans; D008957:Models, Genetic; D011401:Promoter Regions, Genetic / Q000235:genetics*; D017422:Sequence Analysis, DNA / Q000639:trends*; D014157:Transcription Factors / Q000235:genetics*; D014158:Transcription, Genetic / Q000235:genetics*
D014157:Transcription Factors