Spectral affinity in protein networks


Show simple item record

dc.contributor.author Voevodski, Konstantin en_US
dc.contributor.author Teng, Shang-Hua en_US
dc.contributor.author Xia, Yu en_US
dc.date.accessioned 2012-01-11T21:09:34Z
dc.date.available 2012-01-11T21:09:34Z
dc.date.copyright 2009 en_US
dc.date.issued 2009-11-29 en_US
dc.identifier.citation Voevodski, Konstantin, Shang-Hua Teng, Yu Xia. "Spectral affinity in protein networks" 3(): 112-112. (2009) en_US
dc.identifier.issn 1752-0509 en_US
dc.identifier.uri http://hdl.handle.net/2144/3198
dc.description.abstract BACKGROUND. Protein-protein interaction (PPI) networks enable us to better understand the functional organization of the proteome. We can learn a lot about a particular protein by querying its neighborhood in a PPI network to find proteins with similar function. A spectral approach that considers random walks between nodes of interest is particularly useful in evaluating closeness in PPI networks. Spectral measures of closeness are more robust to noise in the data and are more precise than simpler methods based on edge density and shortest path length. RESULTS. We develop a novel affinity measure for pairs of proteins in PPI networks, which uses personalized PageRank, a random walk based method used in context-sensitive search on the Web. Our measure of closeness, which we call PageRank Affinity, is proportional to the number of times the smaller-degree protein is visited in a random walk that restarts at the larger-degree protein. PageRank considers paths of all lengths in a network, therefore PageRank Affinity is a precise measure that is robust to noise in the data. PageRank Affinity is also provably related to cluster co-membership, making it a meaningful measure. In our experiments on protein networks we find that our measure is better at predicting co-complex membership and finding functionally related proteins than other commonly used measures of closeness. Moreover, our experiments indicate that PageRank Affinity is very resilient to noise in the network. In addition, based on our method we build a tool that quickly finds nodes closest to a queried protein in any protein network, and easily scales to much larger biological networks. CONCLUSION. We define a meaningful way to assess the closeness of two proteins in a PPI network, and show that our closeness measure is more biologically significant than other commonly used methods. We also develop a tool, accessible at http://xialab.bu.edu/resources/pnns, that allows the user to quickly find nodes closest to a queried vertex in any protein network available from BioGRID or specified by the user. en_US
dc.description.sponsorship National Science Foundation (IGERT Fellowship grant DGE-0221680; CCR-0635102); PhRMA Foundation (Research Starter Grant in Informatics) en_US
dc.language.iso en en_US
dc.publisher BioMed Central en_US
dc.rights Copyright 2009 Voevodski et al; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. en_US
dc.rights.uri http://creativecommons.org/licenses/by/2.0 en_US
dc.title Spectral affinity in protein networks en_US
dc.type article en_US
dc.identifier.doi 10.1186/1752-0509-3-112 en_US
dc.identifier.pubmedid 19943959 en_US
dc.identifier.pmcid 2797010 en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search OpenBU

Advanced Search


Deposit Materials