Recent advances in the computational discovery of transcription factor binding sites

Tung T. Nguyen, Ioannis P. Androulakis

Research output: Contribution to journalReview article

15 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)582-605
Number of pages24
JournalAlgorithms
Volume2
Issue number1
DOIs
StatePublished - Mar 1 2009

Fingerprint

Transcription factors
Binding sites
Transcription Factor
Synergism
Regulatory Networks
Transcription
Computational methods
Prior Knowledge
Promoter
Gene expression
Regulator
Yeast
Computational Methods
High Throughput
Gene Expression
Genomics
Genes
Throughput
Experimental Data
Gene

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Numerical Analysis
  • Computational Theory and Mathematics
  • Computational Mathematics

Keywords

  • Binding site representation
  • Context-specific
  • Phylogenetic footprinting
  • Promoter analysis
  • Transcription factor binding sites
  • Transcriptional regulatory networks

Cite this

@article{60ce8785a76d4ccbb440e302bbd3bc05,
title = "Recent advances in the computational discovery of transcription factor binding sites",
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 = "Binding site representation, Context-specific, Phylogenetic footprinting, Promoter analysis, Transcription factor binding sites, Transcriptional regulatory networks",
author = "Nguyen, {Tung T.} and Androulakis, {Ioannis P.}",
year = "2009",
month = "3",
day = "1",
doi = "10.3390/a2010582",
language = "English (US)",
volume = "2",
pages = "582--605",
journal = "Algorithms",
issn = "1999-4893",
publisher = "MDPI AG",
number = "1",

}

Recent advances in the computational discovery of transcription factor binding sites. / Nguyen, Tung T.; Androulakis, Ioannis P.

In: Algorithms, Vol. 2, No. 1, 01.03.2009, p. 582-605.

Research output: Contribution to journalReview article

TY - JOUR

T1 - Recent advances in the computational discovery of transcription factor binding sites

AU - Nguyen, Tung T.

AU - Androulakis, Ioannis P.

PY - 2009/3/1

Y1 - 2009/3/1

N2 - 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.

AB - 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.

KW - Binding site representation

KW - Context-specific

KW - Phylogenetic footprinting

KW - Promoter analysis

KW - Transcription factor binding sites

KW - Transcriptional regulatory networks

UR - http://www.scopus.com/inward/record.url?scp=70349370484&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349370484&partnerID=8YFLogxK

U2 - 10.3390/a2010582

DO - 10.3390/a2010582

M3 - Review article

AN - SCOPUS:70349370484

VL - 2

SP - 582

EP - 605

JO - Algorithms

JF - Algorithms

SN - 1999-4893

IS - 1

ER -