학술논문
Computational analyses of eukaryotic promoters
Document Type
article
Author
Source
BMC Bioinformatics, Vol 8, Iss Suppl 6, p S3 (2007)
Subject
Language
English
ISSN
1471-2105
Abstract
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.