Next Article in Journal
Mixed Variational Formulations for Micro-cracked Continua in the Multifield Framework
Next Article in Special Issue
Pattern Recognition and Pathway Analysis with Genetic Algorithms in Mass Spectrometry Based Metabolomics
Previous Article in Journal
Mathematical Programming Techniques for Sensor Networks
Previous Article in Special Issue
A Novel Algorithm for Macromolecular Epitope Matching
Algorithms 2009, 2(1), 582-605; doi:10.3390/a2010582
Review

Recent Advances in the Computational Discovery of Transcription Factor Binding Sites

1,*  and 2,*
Received: 6 January 2009; Accepted: 17 March 2009 / Published: 24 March 2009
(This article belongs to the Special Issue Algorithms and Molecular Sciences)
Download PDF [241 KB, uploaded 24 March 2009]
Abstract: The discovery of gene regulatory elements requires the synergism between computational and experimental techniques in order to reveal the underlying regulatory mechanisms that drive gene expression in response to external cues and signals. Utilizing the large amount of high-throughput experimental data, constantly growing in recent years, researchers have attempted to decipher the patterns which are hidden in the genomic sequences. These patterns, called motifs, are potential binding sites to transcription factors which are hypothesized to be the main regulators of the transcription process. Consequently, precise detection of these elements is required and thus a large number of computational approaches have been developed to support the de novo identification of TFBSs. Even though novel approaches are continuously proposed and almost all have reported some success in yeast and other lower organisms, in higher organisms the problem still remains a challenge. In this paper, we therefore review the recent developments in computational methods for transcription factor binding site prediction. We start with a brief review of the basic approaches for binding site representation and promoter identification, then discuss the techniques to locate physical TFBSs, identify functional binding sites using orthologous information, and infer functional TFBSs within some context defined by additional prior knowledge. Finally, we briefly explore the opportunities for expanding these approaches towards the computational identification of transcriptional regulatory networks.
Keywords: transcription factor binding sites; binding site representation; promoter analysis; phylogenetic footprinting; context-specific; transcriptional regulatory networks transcription factor binding sites; binding site representation; promoter analysis; phylogenetic footprinting; context-specific; transcriptional regulatory networks
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |
EndNote


MDPI and ACS Style

Nguyen, T.T.; Androulakis, I.P. Recent Advances in the Computational Discovery of Transcription Factor Binding Sites. Algorithms 2009, 2, 582-605.

AMA Style

Nguyen TT, Androulakis IP. Recent Advances in the Computational Discovery of Transcription Factor Binding Sites. Algorithms. 2009; 2(1):582-605.

Chicago/Turabian Style

Nguyen, Tung T.; Androulakis, Ioannis P. 2009. "Recent Advances in the Computational Discovery of Transcription Factor Binding Sites." Algorithms 2, no. 1: 582-605.


Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert