Skip to content
naulon

Not checkedNot checked for notices yet.

Identifying regulatory targets of cell cycle transcription factors using gene expression and ChIP-chip data

Li Wen-Hsiung, Wu Wei-Sheng, Chen Bor-Sen

BMC Bioinformatics · 2007

doi:10.1186/1471-2105-8-188 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

<p>Abstract</p> <p>Background</p> <p>ChIP-chip data, which indicate binding of transcription factors (TFs) to DNA regions <it>in vivo</it>, are widely used to reconstruct transcriptional regulatory networks. However, the binding of a TF to a gene does not necessarily imply regulation. Thus, it is important to develop methods to identify regulatory targets of TFs from ChIP-chip data.</p> <p>Results</p> <p>We developed a method, called Temporal Relationship Identification Algorithm (TRIA), which uses gene expression data to identify a TF's regulatory targets among its binding targets inferred from ChIP-chip data. We applied TRIA to yeast cell cycle microarray data and identified many plausible regulatory targets of cell cycle TFs. We validated our predictions by checking the enrichments for functional annotation and known cell cycle genes. Moreover, we showed that TRIA performs better than two published methods (MA-Network and MFA). It is known that co-regulated genes may not be co-expressed. TRIA has the ability to identify subsets of highly co-expressed genes among the regulatory targets of a TF. Different functional roles are found for different subsets, indicating the diverse functions a TF could have. Finally, for a control, we showed that TRIA also performs well for cell-cycle irrelevant TFs.</p> <p>Conclusion</p> <p>Finding the regulatory targets of TFs is important for understanding how cells change their transcription program to adapt to environmental stimuli. Our algorithm TRIA is helpful for achieving this purpose.</p>

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.