Skip Navigation



Bioinformatics Advance Access published online on March 1, 2008

Bioinformatics, doi:10.1093/bioinformatics/btn081
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
24/9/1175    most recent
btn081v1
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 Li, C.
Right arrow Articles by Li, H.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Li, C.
Right arrow Articles by Li, H.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Network-constrained Regularization and Variable Selection for Analysis of Genomic Data

Caiyan Li and Hongzhe Li

Department of Biostatistics and Epidemiology, University of Pennsylvania School of Medicine, Philadelphia, PA 19104

To whom correspondence should be addressed. Prof. Hongzhe Li, E-mail: hongzhe{at}mail.med.upenn.edu


   Abstract

Motivation: Graphs or networks are common ways of depicting information. In biology in particular, many different biological processes are represented by graphs, such as regulatory networks or metabolic pathways. This kind of a priori information gathered over many years of biomedical research is a useful supplement to the standard numerical genomic data such as microarray gene expression data. How to incorporate information encoded by the known biological networks or graphs into analysis of numerical data raises interesting statistical challenges. In this paper, we introduce a network-constrained regularization procedure for linear regression analysis in order to incorporate the information from these graphs into an analysis of the numerical data, where the network is represented as a graph and its corresponding Laplacian matrix. We define a network-constrained penalty function that penalizes the L1-norm of the coefficients but encourages smoothness of the coefficients on the network.

Results: Simulation studies indicated that the method is quite effective in identifying genes and subnetworks that are related to disease and has higher sensitivity than the commonly used procedures that do not use the pathway structure information. Application to one glioblastoma microarray gene expression dataset identified several subnetworks on several of the KEGG transcriptional pathways that are related to survival from glioblastoma, many of which were supported by published literatures.

Availability: The proposed network-constrained regularization procedure efficiently utilizes the known pathway structures in identifying the relevant genes and the subnetworks that might be related to phenotype in a general regression fraemwork. As more biological networks are identified and documented in databases, the proposed method should find more applications in identifying the subnetworks that are related to diseases and other biological processes.

Contact: hongzhe{at}mail.med.upenn.edu

Associate Editor: Dr. Olga Troyanskaya


Received on December 20, 2007; revised on February 17, 2008; accepted on February 27, 2008

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
Z. Tian, T. Hwang, and R. Kuang
A hypergraph-based learning algorithm for classifying gene expression and arrayCGH data with prior knowledge
Bioinformatics, November 1, 2009; 25(21): 2831 - 2838.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
V. Zuber and K. Strimmer
Gene ranking and biomarker discovery under correlation
Bioinformatics, October 15, 2009; 25(20): 2700 - 2707.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
W. Pan
Network-based multiple locus linkage analysis of expression traits
Bioinformatics, June 1, 2009; 25(11): 1390 - 1396.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
I. Ulitsky and R. Shamir
Identifying functional modules using expression profiles and confidence-scored protein interactions
Bioinformatics, May 1, 2009; 25(9): 1158 - 1164.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
B. Zhang, H. Li, R. B. Riggins, M. Zhan, J. Xuan, Z. Zhang, E. P. Hoffman, R. Clarke, and Y. Wang
Differential dependency network analysis to identify condition-specific topological changes in biological networks
Bioinformatics, February 15, 2009; 25(4): 526 - 532.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
J. Noirel, G. Sanguinetti, and P. C. Wright
Identifying differentially expressed subnetworks with MMG
Bioinformatics, December 1, 2008; 24(23): 2792 - 2793.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
H. Binder and M. Schumacher
Comment on 'network-constrained regularization and variable selection for analysis of genomic data'
Bioinformatics, November 1, 2008; 24(21): 2566 - 2568.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
C. Li and H. Li
In Response to Comment on 'Network-constrained regularization and variable selection for analysis of genomic data'
Bioinformatics, November 1, 2008; 24(21): 2569 - 2569.
[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.