The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Modeling interactome: scale-free or geometric?
Open accessAbstract
Motivation: Networks have been used to model many real-world phenomena to better understand the phenomena and to guide experiments in order to predict their behavior. Since incorrect models lead to incorrect predictions, it is vital to have as accurate a model as possible. As a result, new techniques and models for analyzing and modeling real-world networks have recently been introduced. Results: One example of large and complex networks involves protein–protein interaction (PPI) networks. We analyze PPI networks of yeast Saccharomyces cerevisiae and fruitfly Drosophila melanogaster using a newly introduced measure of local network structure as well as the standardly used measures of global network structure. We examine the fit of four different network models, including Erdös-Rényi, scale-free and geometric random network models, to these PPI networks with respect to the measures of local and global network structure. We demonstrate that the currently accepted scale-free model of PPI networks fails to fit the data in several respects and show that a random geometric model provides a much more accurate model of the PPI data. We hypothesize that only the noise in these networks is scale-free. Conclusions: We systematically evaluate how well-different network models fit the PPI networks. We show that the structure of PPI networks is better modeled by a geometric random graph than by a scale-free model. Supplementary information: Supplementary information is available at http://www.cs.utoronto.ca/~juris/data/ppiGRG04/
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Network biology: understanding the cell's functional organization
Barabási, A.-L., & Oltvai, Z. N. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1272 · Cited by 7,903
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
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
Bollobás, B. (1985) · Cited by 6,196
(2010) · Introduction to Combinatorics · doi:10.1201/b12336-12 · Cited by 5,632
Cited by
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
Higher-order organization of complex networks
Benson, A. R., Gleich, D. F., & Leskovec, J. (2016) · Science · doi:10.1126/science.aad9029 · Cited by 1,270
Biological network comparison using graphlet degree distribution
Pržulj, N. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl301 · Cited by 837
Self-citationAnalyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas Boas, P. R., Antiqueira, L., Viana, M. P., & Correa Rocha, L. E. (2011) · Advances in Physics · doi:10.1080/00018732.2011.572452 · Cited by 800
Protein-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
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
Topological network alignment uncovers biological function and phylogeny
Kuchaiev, O., Milenković, T., Memišević, V., Hayes, W., & Pržulj, N. (2010) · Journal of The Royal Society Interface · doi:10.1098/rsif.2010.0063 · Cited by 355
Self-citationEffect of sampling on topology predictions of protein-protein interaction networks
Han, J.-D. J., Dupuy, D., Bertin, N., Cusick, M. E., & Vidal, M. (2005) · Nature Biotechnology · doi:10.1038/nbt1116 · Cited by 344
Unequal evolutionary conservation of human protein interactions in interologous networks
Brown, K. R., & Jurisica, I. (2007) · Genome Biology · doi:10.1186/gb-2007-8-5-r95 · Cited by 340
Self-citationRepresentation learning for dynamic graphs: A survey
Kazemi, S. M., Goel, R., Jain, K., Kobyzev, I., Sethi, A., Forsyth, P., & Poupart, P. (2019) · arXiv · doi:10.48550/arxiv.1905.11485 · Cited by 338
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
Analysis of biological networks
(2017) · Molecular Data Analysis Using R · doi:10.1002/9781119165057.ch10 · Cited by 323
Network structure and the biology of populations
May, R. M. (2006) · Trends in Ecology & Evolution · doi:10.1016/j.tree.2006.03.013 · Cited by 319
Utilizing graph machine learning within drug discovery and development
Gaudelet, T., Day, B., Jamasb, A. R., Soman, J., Regep, C., Liu, G., Hayter, J. B. R., Vickers, R., Roberts, C., Tang, J., et al. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbab159 · Cited by 313
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
Bouritsas, G., Frasca, F., Zafeiriou, S., & Bronstein, M. M. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3154319 · Cited by 309
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-citationMethods for biological data integration: perspectives and challenges
Gligorijević, V., & Pržulj, N. (2015) · Journal of The Royal Society Interface · doi:10.1098/rsif.2015.0571 · Cited by 275
Self-citationComparing methods for comparing networks
Tantardini, M., Ieva, F., Tajoli, L., & Piccardi, C. (2019) · Scientific Reports · doi:10.1038/s41598-019-53708-y · Cited by 264
A Guide to Conquer the Biological Network Era Using Graph Theory
Koutrouli, M., Karatzas, E., Paez-Espino, D., & Pavlopoulos, G. A. (2020) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2020.00034 · Cited by 264
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-citationCao, 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
Higher-order molecular organization as a source of biological function
Gaudelet, T., Malod-Dognin, N., & Pržulj, N. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty570 · Cited by 46
Self-citationGraph theory and stability analysis of protein complex interaction networks
Huang, C., Chen, T., & Ng, K. (2016) · IET Systems Biology · doi:10.1049/iet-syb.2015.0007 · Cited by 18
Network spectra for drug-target identification in complex diseases: new guns against old foes
Rai, A., Shinde, P., & Jalan, S. (2018) · Applied Network Science · doi:10.1007/s41109-018-0107-y · Cited by 12
A stratified approach to function fingerprinting in program binaries using diverse features
Alrabaee, S. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.116384 · Cited by 8
UAG: User Action Graph Based on System Logs for Insider Threat Detection
Wang, X., Jiang, J., Wang, Y., Lv, Q., & Wang, L. (2023) · 2023 IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc58397.2023.10218139 · Cited by 6
Metadata
- Authors
- Pržulj, N., Corneil, D. G., & Jurisica, I.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2004-07-29
- Volume
- 20
- Issue
- 18
- Pages
- 3508-3515
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2148762636
- Cited by
- 706
- References
- 51
- FWCI
- 11.60
- 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.