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. © 2007 Zhang; licensee BioMed Central Ltd.
CITATION STYLE
Zhang, M. Q. (2007, September 27). Computational analyses of eukaryotic promoters. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-8-S6-S3
Mendeley helps you to discover research relevant for your work.