This article is part of the supplement: Otto Warburg International Summer School and Workshop on Networks and Regulation
Review
Computational analyses of eukaryotic promoters
BMC Bioinformatics 2007, 8(Suppl 6):S3 doi:10.1186/1471-2105-8-S6-S3
Published: 27 September 2007Abstract
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.