Computational analyses of eukaryotic promoters

doi:10.1186/1471-2105-8-S6-S3

BMC Bioinformatics
Volume 8
Suppl 6

Viewing options:

Abstract
Full text
PDF (268KB)

Associated material:

PubMed record

Related literature:

Articles citing this article
on BioMed Central
on Google Scholar
on ISI Web of Science
on PubMed Central
Other articles by authors
on Google Scholar

Zhang MQ

on PubMed

Zhang MQ
Related articles/pages
on Google

on Google Scholar

on PubMed

Tools:

Post to:

This article is part of the supplement: Otto Warburg International Summer School and Workshop on Networks and Regulation .

Review

Computational analyses of eukaryotic promoters

Michael Q Zhang

Cold Spring Harbor Laboratory, 1 Bungtown Road, Cold Spring Harbor, NY 11724, USA

corresponding author email

BMC Bioinformatics 2007, 8(Suppl 6):S3doi:10.1186/1471-2105-8-S6-S3


Published:	27 September 2007

Abstract

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.