Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ellrott, K.
Right arrow Articles by Jiang, T.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Ellrott, K.
Right arrow Articles by Jiang, T.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 18 no. 90002 2002
Pages S100-S109
© 2002 Oxford University Press

Identifying transcription factor binding sites through Markov chain optimization

Kyle Ellrott 1,4, Chuhu Yang 2, Frances M. Sladek 3 and Tao Jiang 1

1 Department of Computer Science, University of California, Riverside, CA, 92521, USA
2 Genetics/Bioinformatics Program, University of California, Riverside, CA, 92521, USA
4 Department of Cell Biology and Neuroscience, University of California, Riverside, CA, 92521, USA
4 Protein Informatics Group, Life Sciences Division, Oak Ridge National Laboratory, Oak Ridge, TN, 37831-6480, USA

Received on April 8, 2002 ; accepted on June 15, 2002

Even though every cell in an organism contains the same genetic material, each cell does not express the same cohort of genes. Therefore, one of the major problems facing genomic research today is to determine not only which genes are differentially expressed and under what conditions, but also how the expression of those genes is regulated. The first step in determining differential gene expression is the binding of sequence-specific DNA binding proteins (i.e. transcription factors) to regulatory regions of the genes (i.e. promoters and enhancers). An important aspect to understanding how a given transcription factor functions is to know the entire gamut of binding sites and subsequently potential target genes that the factor may bind/regulate. In this study, we have developed a computer algorithm to scan genomic databases for transcription factor binding sites, based on a novel Markov chain optimization method, and used it to scan the human genome for sites that bind to hepatocyte nuclear factor 4 {alpha} (HNF4{alpha}). A list of 71 known HNF4{alpha} binding sites from the literature were used to train our Markov chain model. By looking at the window of 600 nucleotides around the transcription start site of each confirmed gene on the human genome, we identified 849 sites with varying binding potential and experimentally tested 109 of those sites for binding to HNF4{alpha}. Our results show that the program was very successful in identifying 77 new HNF4{alpha} binding sites with varying binding affinities (i.e. a 71% success rate). Therefore, this computational method for searching genomic databases for potential transcription factor binding sites is a powerful tool for investigating mechanisms of differential gene regulation.

Contact: jiang{at}cs.ucr.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
P. G. S. da Fonseca, K. S. Guimaraes, and M.-F. Sagot
Efficient representation and P-value computation for high-order Markov motifs
Bioinformatics, August 15, 2008; 24(16): i160 - i166.
[Abstract] [PDF]


Home page
BioinformaticsHome page
L. Li, Y. Liang, and R. L. Bass
GAPWM: a genetic algorithm method for optimizing a position weight matrix
Bioinformatics, May 15, 2007; 23(10): 1188 - 1194.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
A. Tomovic and E. J. Oakeley
Position dependencies in transcription factor binding sites
Bioinformatics, April 15, 2007; 23(8): 933 - 941.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
M. A. Battle, G. Konopka, F. Parviz, A. L. Gaggl, C. Yang, F. M. Sladek, and S. A. Duncan
Hepatocyte nuclear factor 4{alpha} orchestrates expression of cell adhesion proteins during the epithelial transformation of the developing liver
PNAS, May 30, 2006; 103(22): 8419 - 8424.
[Abstract] [Full Text] [PDF]


Home page
Toxicol SciHome page
M. Marin-Kuan, S. Nestler, C. Verguet, C. Bezencon, D. Piguet, R. Mansourian, J. Holzwarth, M. Grigorov, T. Delatour, P. Mantle, et al.
A Toxicogenomics Approach to Identify New Plausible Epigenetic Mechanisms of Ochratoxin A Carcinogenicity in Rat
Toxicol. Sci., January 1, 2006; 89(1): 120 - 134.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
J. Hu, B. Li, and D. Kihara
Limitations and potentials of current motif discovery algorithms
Nucleic Acids Res., September 2, 2005; 33(15): 4899 - 4913.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
K. Cartharius, K. Frech, K. Grote, B. Klocke, M. Haltmeier, A. Klingenhoff, M. Frisch, M. Bayerlein, and T. Werner
MatInspector and beyond: promoter analysis based on transcription factor binding sites
Bioinformatics, July 1, 2005; 21(13): 2933 - 2942.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
Z. Liu, F. Mao, J.-t. Guo, B. Yan, P. Wang, Y. Qu, and Y. Xu
Quantitative evaluation of protein-DNA interactions using an optimized knowledge-based potential
Nucleic Acids Res., January 26, 2005; 33(2): 546 - 558.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
V. D. Marinescu, I. S. Kohane, and A. Riva
The MAPPER database: a multi-genome catalog of putative transcription factor binding sites
Nucleic Acids Res., January 1, 2005; 33(suppl_1): D91 - D97.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.