Bioinformatics
Detection of Locally Over-Represented GO Terms in Protein-Protein Interaction Networks
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
A Path Following Algorithm for the Graph Matching Problem
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms for Large, Sparse Network Alignment Problems
ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
Pairwise global alignment of protein interaction networks by matching neighborhood topology
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Automatic parameter learning for multiple network alignment
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
| Hi-index | 0.00 |
Advances in high-throughput technology has led to an increased amount of available data on protein-protein interaction (PPI) data. Detecting and extracting functional modules that are common across multiple networks is an important step towards understanding the role of functional modules and how they have evolved across species. A global protein-protein interaction network alignment algorithm attempts to find such functional orthologs across multiple networks. In this article, we propose a scalable global network alignment algorithm based on clustering methods and graph matching techniques in order to detect conserved interactions while simultaneously attempting to maximize the sequence similarity of nodes involved in the alignment. We present an algorithm for multiple alignments, in which several protein-protein interaction networks are aligned. We empirically evaluated our algorithm on several real biological datasets. We find that our approach offers a significant benefit both in terms of quality as well as speed over the state-of-the-art.