New directions for diffusion-based network prediction of protein function: incorporating pathways with confidence
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Motivation: It has long been hypothesized that incorporating models of network noise as well as edge directions and known pathway information into the representation of protein–protein interaction (PPI) networks might improve their utility for functional inference. However, a simple way to do this has not been obvious. We find that diffusion state distance (DSD), our recent diffusion-based metric for measuring dissimilarity in PPI networks, has natural extensions that incorporate confidence, directions and can even express coherent pathways by calculating DSD on an augmented graph. Results: We define three incremental versions of DSD which we term cDSD, caDSD and capDSD, where the capDSD matrix incorporates confidence, known directed edges, and pathways into the measure of how similar each pair of nodes is according to the structure of the PPI network. We test four popular function prediction methods (majority vote, weighted majority vote, multi-way cut and functional flow) using these different matrices on the Baker’s yeast PPI network in cross-validation. The best performing method is weighted majority vote using capDSD. We then test the performance of our augmented DSD methods on an integrated heterogeneous set of protein association edges from the STRING database. The superior performance of capDSD in this context confirms that treating the pathways as probabilistic units is more powerful than simply incorporating pathway edges independently into the network. Availability: All source code for calculating the confidences, for extracting pathway information from KEGG XML files, and for calculating the cDSD, caDSD and capDSD matrices are available from http://dsd.cs.tufts.edu/capdsd Contact: lenore.cowen@tufts.edu or benjamin.hescott@tufts.edu Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
STRING v9.1: protein-protein interaction networks, with increased coverage and integration
Franceschini, A., Szklarczyk, D., Frankild, S., Kuhn, M., Simonovic, M., Roth, A., Lin, J., Minguez, P., Bork, P., von Mering, C., et al. (2012) · Nucleic Acids Research · doi:10.1093/nar/gks1094 · Cited by 4,398 · cited 3×
“…pathway information from KEGG XML files, and for calculating the cDSD, caDSD and capDSD matrices are available from http://dsd. cs.tufts.edu/capdsd Contact: lenore.cowen@tufts.edu or benjamin.hescott@tufts.edu Supplementary information: Supplementary data are available at Bioinformatics online.”
MethodInfluentialBioGRID: a general repository for interaction datasets
Stark, C. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkj109 · Cited by 3,960 · cited 3×
“In particular, our PPI network is defined with a vertex set V, containing a node for each verified ORF, and an edge set E, containing an unweighted and undir- ected edge for each physical interaction.”
BackgroundMethodComprehensive curation and analysis of global interaction networks in Saccharomyces cerevisiae
Reguly, T., Breitkreutz, A., Boucher, L., Breitkreutz, B.-J., Hon, G. C., Myers, C. L., Parsons, A., Friesen, H., Oughtred, R., Tong, A., et al. (2006) · Journal of Biology · doi:10.1186/jbiol36 · Cited by 326 · cited 1×
“…pathway information from KEGG XML files, and for calculating the cDSD, caDSD and capDSD matrices are available from http://dsd. cs.tufts.edu/capdsd Contact: lenore.cowen@tufts.edu or benjamin.hescott@tufts.edu Supplementary information: Supplementary data are available at Bioinformatics online.”
MethodA gene ontology inferred from molecular networks
Dutkowski, J., Kramer, M., Surma, M. A., Balakrishnan, R., Cherry, J. M., Krogan, N. J., & Ideker, T. (2013) · Nature Biotechnology · doi:10.1038/nbt.2463 · Cited by 184
Cao, M., Zhang, H., Park, J., Daniels, N. M., Crovella, M. E., Cowen, L. J., & Hescott, B. (2013) · PLoS ONE · doi:10.1371/journal.pone.0076339 · Cited by 131 · cited 1×
“In 2013, based on the observation that paths through high-degree ‘hub’ nodes in the PPI network were less informative than short paths through protein nodes with fewer interaction partners, (Cao et al., 2013) introduce the diffusion state distance (DSD) metric that is able to quantify topological similarity in a PPI n…”
Self-citationMoustakas, A. (2002) · Journal of Cell Science · doi:10.1242/jcs.115.17.3355 · Cited by 79
Cited by
Szklarczyk, D., Gable, A. L., Lyon, D., Junge, A., Wyder, S., Huerta-Cepas, J., Simonovic, M., Doncheva, N. T., Morris, J. H., Bork, P., et al. (2019) · Nucleic Acids Research · doi:10.1093/nar/gky1131 · Cited by 17,749
Luo, Y., Zhao, X., Zhou, J., Yang, J., Zhang, Y., Kuang, W., Peng, J., Chen, L., & Zeng, J. (2017) · Nature Communications · doi:10.1038/s41467-017-00680-8 · Cited by 916
Network propagation: a universal amplifier of genetic associations
Cowen, L., Ideker, T., Raphael, B. J., & Sharan, R. (2017) · Nature Reviews Genetics · doi:10.1038/nrg.2017.38 · Cited by 657
Self-citationdeepDR: a network-based deep learning approach to in silico drug repositioning
Zeng, X., Zhu, S., Liu, X., Zhou, Y., Nussinov, R., & Cheng, F. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz418 · Cited by 535
Predicting protein functions using incomplete hierarchical labels
Yu, G., Zhu, H., & Domeniconi, C. (2015) · BMC Bioinformatics · doi:10.1186/s12859-014-0430-y · Cited by 360
Metadata
- Authors
- Cao, M., Pietras, C. M., Feng, X., Doroschak, K. J., Schaffner, T., Park, J., Zhang, H., Cowen, L. J., & Hescott, B. J.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2014-06-11
- Volume
- 30
- Issue
- 12
- Pages
- i219-i227
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2098427571
- Cited by
- 120
- References
- 6
- FWCI
- 3.29
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.