Skip Navigation



Bioinformatics Advance Access published online on September 6, 2005
Bioinformatics, doi:10.1093/bioinformatics/bti656
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
21/21/4033    most recent
bti656v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 Yu, T.
Right arrow Articles by Li, K.-C.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Yu, T.
Right arrow Articles by Li, K.-C.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2005). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
Received July 25, 2005
Revised August 24, 2005
Accepted August 30, 2005

Article

Inference of transcriptional regulatory network by two-stage constrained-space factor analysis

Tianwei Yu 1 and Ker-Chau Li 1*

1 Department of Statistics, University of California, Los Angeles, CA 90095-1554

* To whom correspondence should be addressed.
Ker-Chau Li, E-mail: kcli{at}stat.ucla.edu


  Abstract

Motivation: Microarray gene expression and cross-linking chromatin immunoprecipitation (ChIP) data contain voluminous information that can help the identification of transcriptional regulatory networks at the full genome scale. Such high throughput data are noisy however. In contrast, from the biomedical literature, we can find many evidenced transcription factor (TF) - target gene binding relationships that have been elucidated at the molecular level. But such sporadically-generated knowledge only offers glimpses on limited patches of the network. How to incorporate this valuable knowledge resource to build more reliable network models remains a question.

Results: We present a modified factor analysis approach. Our algorithm starts with the evidenced TF-gene linkages. It iterates between the network configuration estimation step and the connection strength estimation step, using the high-throughput data, till convergence. We report two comprehensive regulatory networks obtained for Saccharomyces cerevisiae, one under the normal growth condition and the other under the environmental stress condition.


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
H. Li and M. Zhan
Unraveling transcriptional regulatory programs by integrative analysis of microarray and transcription factor binding data
Bioinformatics, September 1, 2008; 24(17): 1874 - 1880.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
C. Chang, Z. Ding, Y. S. Hung, and P. C. W. Fung
Fast network component analysis (FastNCA) for gene regulatory network reconstruction from microarray data
Bioinformatics, June 1, 2008; 24(11): 1349 - 1358.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
S. Yuan and K.-C. Li
Context-dependent clustering for dynamic cellular state modeling of microarray gene expression
Bioinformatics, November 15, 2007; 23(22): 3039 - 3047.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
W. Sun, T. Yu, and K.-C. Li
Detection of eQTL modules mediated by activity levels of transcription factors
Bioinformatics, September 1, 2007; 23(17): 2290 - 2297.
[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.