Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology
The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
A comprehensive analysis of protein–protein interactions in Saccharomyces cerevisiae
Uetz, P., Giot, L., Cagney, G., Mansfield, T. A., Judson, R. S., Knight, J. R., Lockshon, D., Narayan, V., Srinivasan, M., Pochart, P., et al. (2000) · Nature · doi:10.1038/35001009 · Cited by 4,706
A comprehensive two-hybrid analysis to explore the yeast protein interactome
Ito, T., Chiba, T., Ozawa, R., Yoshida, M., Hattori, M., & Sakaki, Y. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.061034498 · Cited by 3,566
Specificity and Stability in Topology of Protein Networks
Maslov, S., & Sneppen, K. (2002) · Science · doi:10.1126/science.1065103 · Cited by 3,051 · cited 1×
“We then randomized a fraction p of its edges using the MaslovSneppen trick that preserves node degrees [19]: we randomly choose two edges (a, b) and (c, d), remove them, and introduce new edges (a, d) and (c, b).”
MethodGlobal landscape of protein complexes in the yeast Saccharomyces cerevisiae
Krogan, N. J., Cagney, G., Yu, H., Zhong, G., Guo, X., Ignatchenko, A., Li, J., Pu, S., Datta, N., Tikuisis, A. P., et al. (2006) · Nature · doi:10.1038/nature04670 · 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
Evidence for dynamically organized modularity in the yeast protein–protein interaction network
Han, J.-D. J., Bertin, N., Hao, T., Goldberg, D. S., Berriz, G. F., Zhang, L. V., Dupuy, D., Walhout, A. J. M., Cusick, M. E., Roth, F. P., et al. (2004) · Nature · doi:10.1038/nature02555 · Cited by 1,798
Xenarios, I. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.303 · Cited by 1,741
Inparanoid: a comprehensive database of eukaryotic orthologs
O'Brien, K. P. (2004) · Nucleic Acids Research · doi:10.1093/nar/gki107 · Cited by 742
Functional and topological characterization of protein interaction networks
Yook, S., Oltvai, Z. N., & Barabási, A. (2004) · PROTEOMICS · doi:10.1002/pmic.200300636 · Cited by 613
Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps
Nabieva, E., Jim, K., Agarwal, A., Chazelle, B., & Singh, M. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1054 · Cited by 500
The FlyBase database of the Drosophila genome projects and community literature
(2003) · Nucleic Acids Research · doi:10.1093/nar/gkg094 · Cited by 490
PathBLAST: a tool for alignment of protein interaction networks
Kelley, B. P., Yuan, B., Lewitter, F., Sharan, R., Stockwell, B. R., & Ideker, T. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh411 · Cited by 420
Græmlin: General and robust alignment of multiple large interaction networks
Flannick, J., Novak, A., Srinivasan, B. S., McAdams, H. H., & Batzoglou, S. (2006) · Genome Research · doi:10.1101/gr.5235706 · Cited by 320
The GRID: The General Repository for Interaction Datasets
Breitkreutz, B.-J., Stark, C., & Tyers, M. (2003) · Genome Biology · doi:10.1186/gb-2003-4-3-r23 · Cited by 295
Large-scale identification of yeast integral membrane protein interactions
Miller, J. P., Lo, R. S., Ben-Hur, A., Desmarais, C., Stagljar, I., Noble, W. S., & Fields, S. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0505482102 · Cited by 269
Alignment of metabolic pathways
Pinter, R. Y., Rokhlenko, O., Yeger-Lotem, E., & Ziv-Ukelson, M. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti554 · Cited by 214
Systematic identification of functional orthologs based on protein network comparison
Bandyopadhyay, S., Sharan, R., & Ideker, T. (2006) · Genome Research · doi:10.1101/gr.4526006 · Cited by 189
RANDOM FOREST SIMILARITY FOR PROTEIN-PROTEIN INTERACTION PREDICTION FROM MULTIPLE SOURCES
QI, Y., KLEIN-SEETHARAMAN, J., & BAR-JOSEPH, Z. (2004) · Biocomputing 2005 · doi:10.1142/9789812702456_0050 · Cited by 175
Kellis, M., Patterson, N., Birren, B., Berger, B., & Lander, E. S. (2004) · Journal of Computational Biology · doi:10.1089/1066527041410319 · Cited by 105
Self-citationPairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution
Koyutürk, M., Grama, A. Y., & Szpankowski, W. (2005) · Lecture notes in computer science · doi:10.1007/11415770_4 · Cited by 73
A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks
Gat‐Viks, I., Tanay, A., Raijman, D., & Ron Shamir, A. (2006) · Journal of Computational Biology · doi:10.1089/cmb.2006.13.165 · Cited by 59
STRUCT2NET: INTEGRATING STRUCTURE INTO PROTEIN-PROTEIN INTERACTION PREDICTION
Singh, R., Xu, J., & Berger, B. (2005) · Pacific Symposium on Biocomputing (PSB) · doi:10.1142/9789812701626_0037 · Cited by 52
Self-citationA joint model of regulatory and metabolic networks
Yeang, C., & Vingron, M. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-332 · Cited by 49
Cited by
Gleich, D. F. (2015) · SIAM Review · doi:10.1137/140976649 · Cited by 646
IsoRankN: spectral methods for global alignment of multiple protein networks
Liao, C.-S., Lu, K., Baym, M., Singh, R., & Berger, B. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp203 · Cited by 396
Self-citationA Path Following Algorithm for the Graph Matching Problem
Zaslavskiy, M., Bach, F., & Vert, J.-P. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.245 · Cited by 385
Inferring anchor links across multiple heterogeneous social networks
Kong, X., Zhang, J., & Yu, P. S. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505531 · Cited by 356
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
Metadata
- Authors
- Singh, R., Xu, J., & Berger, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-05-17
- Pages
- 16-31
- OpenAlex
- W1518994209
- Cited by
- 286
- References
- 25
- FWCI
- 49.42
- Type
- conference paper
- Language
- en
- Open access
- closed
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.