The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Functional topology in a network of protein interactions
Open accessAbstract
Motivation: The building blocks of biological networks are individual protein–protein interactions (PPIs). The cumulative PPI data set in Saccharomyces cerevisiae now exceeds 78 000. Studying the network of these interactions will provide valuable insight into the inner workings of cells. Results: We performed a systematic graph theory-based analysis of this PPI network to construct computational models for describing and predicting the properties of lethal mutations and proteins participating in genetic interactions, functional groups, protein complexes and signaling pathways. Our analysis suggests that lethal mutations are not only highly connected within the network, but they also satisfy an additional property: their removal causes a disruption in network structure. We also provide evidence for the existence of alternate paths that bypass viable proteins in PPI networks, while such paths do not exist for lethal mutations. In addition, we show that distinct functional classes of proteins have differing network properties. We also demonstrate a way to extract and iteratively predict protein complexes and signaling pathways. We evaluate the power of predictions by comparing them with a random model, and assess accuracy of predictions by analyzing their overlap with MIPS database. Conclusions: Our models provide a means for understanding the complex wiring underlying cellular function, and enable us to predict essentiality, genetic interaction, function, protein complexes and cellular pathways. This analysis uncovers structure–function relationships observable in a large PPI network. Supplementary information: We are placing the full predicted tables on the web page: http://www.cs.utoronto.ca/~juris/data/b03/SuppDataTables.zip
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368 · cited 1×
“This supports earlier findings that complex networks comprise simple building blocks (Shen-Orr et al., 2002; Milo et al., 2002), which are hierarchically organized into modules (Ravasz et al., 2002).”
ResultAn automated method for finding molecular complexes in large protein interaction networks
Bader, G. D., & Hogue, C. W. (2003) · BMC Bioinformatics · doi:10.1186/1471-2105-4-2 · Cited by 6,072
Lethality and centrality in protein networks
Jeong, H., Mason, S. P., Barabási, A.-L., & Oltvai, Z. N. (2001) · Nature · doi:10.1038/35075138 · Cited by 5,287
Hierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224 · cited 2×
“, 2002), which are hierarchically organized into modules (Ravasz et al., 2002).”
BackgroundResultSystematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry
Ho, Y., Gruhler, A., Heilbut, A., Bader, G. D., Moore, L., Adams, S.-L., Millar, A., Taylor, P., Bennett, K., Boutilier, K., et al. (2002) · Nature · doi:10.1038/415180a · Cited by 3,601
Specificity and Stability in Topology of Protein Networks
Maslov, S., & Sneppen, K. (2002) · Science · doi:10.1126/science.1065103 · Cited by 3,051
Network motifs in the transcriptional regulation network of Escherichia coli
Shen-Orr, S. S., Milo, R., Mangan, S., & Alon, U. (2002) · Nature Genetics · doi:10.1038/ng881 · Cited by 2,952
Comparative assessment of large-scale data sets of protein–protein interactions
von Mering, C., Krause, R., Snel, B., Cornell, M., Oliver, S. G., Fields, S., & Bork, P. (2002) · Nature · doi:10.1038/nature750 · Cited by 2,365
Cited by
cytoHubba: identifying hub objects and sub-networks from complex interactome
Chin, C.-H., Chen, S.-H., Wu, H.-H., Ho, C.-W., Ko, M.-T., & Lin, C.-Y. (2014) · BMC Systems Biology · doi:10.1186/1752-0509-8-s4-s11 · Cited by 6,562
Network‐based prediction of protein function
Sharan, R., Ulitsky, I., & Shamir, R. (2007) · Molecular Systems Biology · doi:10.1038/msb4100129 · Cited by 1,074
Protein complex prediction via cost-based clustering
King, A. D., Pržulj, N., & Jurisica, I. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth351 · Cited by 666
Self-citationProtein-to-protein interactions: Technologies, databases, and algorithms
Cannataro, M., Guzzi, P. H., & Veltri, P. (2010) · ACM Computing Surveys · doi:10.1145/1824795.1824796 · Cited by 620
Complex discovery from weighted PPI networks
Liu, G., Wong, L., & Chua, H. N. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp311 · Cited by 470
Graph-based methods for analysing networks in cell biology
Aittokallio, T. (2006) · Briefings in Bioinformatics · doi:10.1093/bib/bbl022 · Cited by 429
Graph theory and networks in Biology
Mason, O., & Verwoerd, M. (2007) · IET Systems Biology · doi:10.1049/iet-syb:20060038 · Cited by 398
A core-attachment based method to detect protein complexes in PPI networks
Wu, M., Li, X., Kwoh, C.-K., & Ng, S.-K. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-169 · Cited by 378
Predicting Protein–Protein Interactions from the Molecular to the Proteome Level
Keskin, O., Tuncbag, N., & Gursoy, A. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.5b00683 · Cited by 369
Computational approaches for detecting protein complexes from protein interaction networks: a survey
Li, X., Wu, M., Kwoh, C.-K., & Ng, S.-K. (2010) · BMC Genomics · doi:10.1186/1471-2164-11-s1-s3 · Cited by 349
Automated Network Analysis Identifies Core Pathways in Glioblastoma
Cerami, E., Demir, E., Schultz, N., Taylor, B. S., & Sander, C. (2010) · PLoS ONE · doi:10.1371/journal.pone.0008918 · Cited by 333
Comprehensive 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
Hubba: hub objects analyzer—a framework of interactome hubs identification for network biology
Lin, C.-Y., Chin, C.-H., Wu, H.-H., Chen, S.-H., Ho, C.-W., & Ko, M.-T. (2008) · Nucleic Acids Research · doi:10.1093/nar/gkn257 · Cited by 287
Uncovering Biological Network Function via Graphlet Degree Signatures
Milenković, T., & Pržulj, N. (2008) · Cancer Informatics · doi:10.4137/cin.s680 · Cited by 278
Self-citationLi, M., Zhang, H., Wang, J.-X., & Pan, Y. (2012) · BMC Systems Biology · doi:10.1186/1752-0509-6-15 · Cited by 257
Protein-protein interaction networks and biology—what's the connection?
Hakes, L., Pinney, J. W., Robertson, D. L., & Lovell, S. C. (2008) · Nature Biotechnology · doi:10.1038/nbt0108-69 · Cited by 200
Geometric De-noising of Protein-Protein Interaction Networks
Kuchaiev, O., Rašajski, M., Higham, D. J., & Pržulj, N. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000454 · Cited by 180
Self-citation
Metadata
- Authors
- Pržulj, N., Wigle, D. A., & Jurisica, I.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2004-02-12
- Volume
- 20
- Issue
- 3
- Pages
- 340-348
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2118446779
- Cited by
- 422
- References
- 30
- FWCI
- 3.83
- Type
- journal article
- Language
- en
- Open access
- bronze
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.