Skip Navigation


Nucleic Acids Research Advance Access originally published online on April 13, 2008
Nucleic Acids Research 2008 36(9):e48; doi:10.1093/nar/gkn145
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (6006K) Freely available
Right arrow Screen PDF (717K) Freely available
Right arrow Supplementary Data
Right arrowOA All Versions of this Article:
36/9/e48    most recent
gkn145v1
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 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 arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Zhao, X.-M.
Right arrow Articles by Aihara, K.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Zhao, X.-M.
Right arrow Articles by Aihara, K.
Related Collections
Right arrow Computational methods
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2008, Vol. 36, No. 9 e48
© 2008 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.


Methods Online

Uncovering signal transduction networks from high-throughput data by integer linear programming

Xing-Ming Zhao1,2,3,4, Rui-Sheng Wang5, Luonan Chen1,3,4,5 and Kazuyuki Aihara1,3,*

1ERATO Aihara Complexity Modelling Project, JST, Tokyo 151-0064, Japan, 2Intelligent Computing Lab, Hefei Institute of Intelligent Machines, Hefei, Anhui, China, 3Institute of Industrial Science, The University of Tokyo, Tokyo 153-8505, Japan, 4Institute of Systems Biology, Shanghai University, China and 5Department of Electrical Engineering and Electronics, Osaka Sangyo University, Osaka 574-8530, Japan

*To whom correspondence should be addressed. Tel: +81 3 5452 6691; Fax: +81 3 5452 6692; Email: aihara{at}sat.t.u-tokyo.ac.jp

Received December 10, 2007. Revised February 19, 2008. Accepted March 14, 2008.

Signal transduction is an important process that transmits signals from the outside of a cell to the inside to mediate sophisticated biological responses. Effective computational models to unravel such a process by taking advantage of high-throughput genomic and proteomic data are needed to understand the essential mechanisms underlying the signaling pathways. In this article, we propose a novel method for uncovering signal transduction networks (STNs) by integrating protein interaction with gene expression data. Specifically, we formulate STN identification problem as an integer linear programming (ILP) model, which can be actually solved by a relaxed linear programming algorithm and is flexible for handling various prior information without any restriction on the network structures. The numerical results on yeast MAPK signaling pathways demonstrate that the proposed ILP model is able to uncover STNs or pathways in an efficient and accurate manner. In particular, the prediction results are found to be in high agreement with current biological knowledge and available information in literature. In addition, the proposed model is simple to be interpreted and easy to be implemented even for a large-scale system.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




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.