Skip Navigation



Bioinformatics Advance Access published online on April 27, 2007
Bioinformatics, doi:10.1093/bioinformatics/btm156
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow Supplementary Data
Right arrow All Versions of this Article:
23/13/1631    most recent
btm156v1
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, Z.
Right arrow Articles by Chen, L.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Li, Z.
Right arrow Articles by Chen, L.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Alignment of molecular networks by integer quadratic programming

Zhenping Li a,b,*, Shihua Zhang b,*, Yong Wang b,c, Xiang-Sun Zhang b,{dagger} and Luonan Chen c,{dagger}

aBeijing Wuzi University, Beijing 101149, China bAcademy of Mathematics and Systems Science,CAS, Beijing 100080, China cOsaka Sangyo University, Osaka 574-8530, Japan

{dagger}corresponding author. Xiang-Sun Zhang, E-mail: zxs{at}amt.ac.cn, Luonan Chen, chen{at}elec.osaka-sandai.ac.jp


  Abstract

Motivation: With more and more data on molecular networks (e.g. protein interaction networks, gene regulatory networks and metabolic networks) available, the discovery of conserved patterns or signaling pathways by comparing various kinds of networks among different species or within a species becomes an increasingly important problem. However, most of the conventional approaches either restrict comparative analysis to special structures, such as pathways, or adopt heuristic algorithms due to computational burden.

Results: In this paper, to find the conserved substructures, we develop an efficient algorithm for aligning molecular networks based on both molecule similarity and architecture similarity, by using integer quadratic programming (IQP). Such an IQP can be relaxed into the corresponding quadratic programming (QP) which almost always ensures an integer solution, thereby making molecular network alignment tractable without any approximation. The proposed framework is very flexible and can be applied to many kinds of molecular networks including weighted and unweighted, directed and undirected networks with or without loops.

Availability: Matlab code and data are available from http://zhangroup.aporc.org/bioinfo/MNAligner or http://intelligent.eic.osaka-sandai.ac.jp/chenen/software/MNAligner, or upon request from authors.

*these authors contributed equally

Associate Editor: Prof. John Quackenbush

Received on December 20, 2006; revised on March 19, 2007; accepted on April 17, 2007

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
X. Guo and A. J. Hartemink
Domain-oriented edge-based alignment of protein interaction networks
Bioinformatics, June 15, 2009; 25(12): i240 - 1246.
[Abstract] [Full Text] [PDF]

Home page
 Brief BioinformHome page
B. S. Srinivasan, N. H. Shah, J. A. Flannick, E. Abeliuk, A. F. Novak, and S. Batzoglou
Current progress in network research: toward reference networks for key model organisms
Brief Bioinform, September 1, 2007; 8(5): 318 - 332.
[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.