A fast approach to global alignment of protein-protein interaction networks
Open Access
- 31 January 2013
- journal article
- Published by Springer Nature in BMC Research Notes
- Vol. 6 (1) , 35
Abstract
Global network alignment has been proposed as an effective tool for computing functional orthology. Commonly used global alignment techniques such as IsoRank rely on a two-step process: the first step is an iterative diffusion-based approach for assigning similarity scores to all possible node pairs (matchings); the second step applies a maximum-weight bipartite matching algorithm to this similarity score matrix to identify orthologous node pairs. While demonstrably successful in identifying orthologies beyond those based on sequences, this two-step process is computationally expensive. Recent work on computation of node-pair similarity matrices has demonstrated that the computational cost of the first step can be significantly reduced. The use of these accelerated methods renders the bipartite matching step as the dominant computational cost. This motivates a critical assessment of the tradeoffs of computational cost and solution quality (matching quality, topological matches, and biological significance) associated with the bipartite matching step. In this paper we utilize the state-of-the-art core diffusion-based step in IsoRank for similarity matrix computation, and couple it with two heuristic bipartite matching algorithms – a matrix-based greedy approach, and a tunable, adaptive, auction-based matching algorithm developed by us. We then compare our implementations against the performance and quality characteristics of the solution produced by the reference IsoRank binary, which also implements an optimal matching algorithm.Keywords
This publication has 19 references indexed in Scilit:
- An auction-based weighted matching implementation on massively parallel architecturesParallel Computing, 2012
- Global alignment of multiple protein interaction networks with application to functional orthology detectionProceedings of the National Academy of Sciences, 2008
- Fast and Accurate Alignment of Multiple Protein Networks2008
- Pairwise Alignment of Protein Interaction NetworksJournal of Computational Biology, 2006
- Conserved patterns of protein interaction in multiple speciesProceedings of the National Academy of Sciences of the United States of America, 2005
- GO::TermFinder—open source software for accessing Gene Ontology information and finding significantly enriched Gene Ontology terms associated with a list of genesBioinformatics, 2004
- PathBLAST: a tool for alignment of protein interaction networksNucleic Acids Research, 2004
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web SearchingSIAM Review, 2004
- The auction algorithm: A distributed relaxation method for the assignment problemAnnals of Operations Research, 1988
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955