Skip Navigation


Bioinformatics Advance Access originally published online on December 22, 2006
Bioinformatics 2007 23(4):473-479; doi:10.1093/bioinformatics/btl640
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Supplementary Data
Right arrow All Versions of this Article:
23/4/473    most recent
btl640v1
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 ISI Web of Science
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 Li, H.
Right arrow Articles by Zhan, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Li, H.
Right arrow Articles by Zhan, M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

The discovery of transcriptional modules by a two-stage matrix decomposition approach

Huai Li , Yu Sun and Ming Zhan *

Bioinformatics Unit, Branch of Research Resources, National Institute on Aging NIH, Baltimore, MD 21224, USA

*To whom correspondence should be addressed.


  Abstract

Motivation: We address the problem of identifying gene transcriptional modules from gene expression data by proposing a new approach. Genes mostly interact with each other to form transcriptional modules for context-specific cellular activities or functions. Unraveling such transcriptional modules is important for understanding biological network, deciphering regulatory mechanisms and identifying biomarkers.

Method: The proposed algorithm is based on two-stage matrix decomposition. We first model microarray data as non-linear mixtures and adopt the non-linear independent component analysis to reduce the non-linear distortion and separate the data into independent latent components. We then apply the probabilistic sparse matrix decomposition approach to model the ‘hidden’ expression profiles of genes across the independent latent components as linear weighted combinations of a small number of transcriptional regulator profiles. Finally, we propose a general scheme for identifying gene modules from the outcomes of the matrix decomposition.

Results: The proposed algorithm partitions genes into non-mutually exclusive transcriptional modules, independent from expression profile similarity measurement. The modules contain genes with not only similar but different expression patterns, and show the highest enrichment of biological functions in comparison with those by other methods. The usefulness of the algorithm was validated by a yeast microarray data analysis.

Availability: The software is available upon request to the authors.

Contact: zhanmi{at}mail.nih.gov

Associate Editor: Golan Yona

Received on September 18, 2006; revised on November 14, 2006; accepted on December 14, 2006

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]


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.