Close
Help
Home Journals Subjects About My LA Reviewers Authors News Submit
Username: Password:
.
(close)

(Ctrl-click to select multiple journals)


How should we address you?

Your email address


Enter the three character code
Visual CAPTCHA
Privacy Statement
 
 
 
 
 
 

Optimal Network Alignment with Graphlet Degree Vectors

Authors: Tijana Milenković, Weng Leong Ng, Wayne Hayes and Nataša Pržulj
Publication Date: 30 Jun 2010
Cancer Informatics 2010:9 121-137

Tijana Milenković1,2, Weng Leong Ng2, Wayne Hayes2,3 and Nataša Pržulj1

1Department of Computing, Imperial College London SW7 2AZ, UK. 2Department of Computer Science, University of California, Irvine, CA 92697-3435, USA. 3Department of Mathematics, Imperial College London SW7 2AZ, UK.

Abstract

Important biological information is encoded in the topology of biological networks. Comparative analyses of biological networks are proving to be valuable, as they can lead to transfer of knowledge between species and give deeper insights into biological function, disease, and evolution. We introduce a new method that uses the Hungarian algorithm to produce optimal global alignment between two networks using any cost function. We design a cost function based solely on network topology and use it in our network alignment. Our method can be applied to any two networks, not just biological ones, since it is based only on network topology. We use our new method to align protein-protein interaction networks of two eukaryotic species and demonstrate that our alignment exposes large and topologically complex regions of network similarity. At the same time, our alignment is biologically valid, since many of the aligned protein pairs perform the same biological function. From the alignment, we predict function of yet unannotated proteins, many of which we validate in the literature. Also, we apply our method to find topological similarities between metabolic networks of different species and build phylogenetic trees based on our network alignment score. The phylogenetic trees obtained in this way bear a striking resemblance to the ones obtained by sequence alignments. Our method detects topologically similar regions in large networks that are statistically significant. It does this independent of protein sequence or any other information external to network topology.