The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Global alignment of multiple protein interaction networks with application to functional orthology detection
Open accessAbstract
Protein–protein interactions (PPIs) and their networks play a central role in all biological processes. Akin to the complete sequencing of genomes and their comparative analysis, complete descriptions of interactomes and their comparative analysis is fundamental to a deeper understanding of biological processes. A first step in such an analysis is to align two or more PPI networks. Here, we introduce an algorithm, IsoRank, for global alignment of multiple PPI networks. The guiding intuition here is that a protein in one PPI network is a good match for a protein in another network if their respective sequences and neighborhood topologies are a good match. We encode this intuition as an eigenvalue problem in a manner analogous to Google's PageRank method. Using IsoRank, we compute a global alignment of the Saccharomyces cerevisiae , Drosophila melanogaster , Caenorhabditis elegans , Mus musculus , and Homo sapiens PPI networks. We demonstrate that incorporating PPI data in ortholog prediction results in improvements over existing sequence-only approaches and over predictions from local alignments of the yeast and fly networks. Previous methods have been effective at identifying conserved, localized network patterns across pairs of networks. This work takes the further step of performing a global alignment of multiple PPI networks. It simultaneously uses sequence similarity and network data and, unlike previous approaches, explicitly models the tradeoff inherent in combining them. We expect IsoRank—with its simultaneous handling of node similarity and network similarity—to be applicable across many scientific domains.
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
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
The COG database: an updated version includes eukaryotes
Tatusov, R. L., Fedorova, N. D., Jackson, J. D., Jacobs, A. R., Kiryutin, B., Koonin, E. V., Krylov, D. M., Mazumder, R., Mekhedov, S. L., Nikolskaya, A. N., et al. (2003) · BMC Bioinformatics · doi:10.1186/1471-2105-4-41 · Cited by 4,430
A Genomic Perspective on Protein Families
Tatusov, R. L., Koonin, E. V., & Lipman, D. J. (1997) · Science · doi:10.1126/science.278.5338.631 · Cited by 3,590
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
Global 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
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
A spectral technique for correspondence problems using pairwise constraints
Leordeanu, M., & Hebert, M. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.20 · Cited by 1,222
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
Conserved pathways within bacteria and yeast as revealed by global protein network alignment
Kelley, B. P., Sharan, R., Karp, R. M., Sittler, T., Root, D. E., Stockwell, B. R., & Ideker, T. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1534710100 · Cited by 529
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
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
Herpesviral Protein Networks and Their Interaction with the Human Proteome
Uetz, P., Dong, Y.-A., Zeretzke, C., Atzler, C., Baiker, A., Berger, B., Rajagopala, S. V., Roupelieva, M., Rose, D., Fossum, E., et al. (2006) · Science · doi:10.1126/science.1116804 · Cited by 407
Self-citationAssessing Performance of Orthology Detection Strategies Applied to Eukaryotic Genomes
Chen, F., Mackey, A. J., Vermunt, J. K., & Roos, D. S. (2007) · PLoS ONE · doi:10.1371/journal.pone.0000383 · Cited by 382
Predicting protein function from protein/protein interaction data: a probabilistic approach
Letovsky, S., & Kasif, S. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg1026 · Cited by 380
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
Whole-genome annotation by using evidence integration in functional-linkage networks
Karaoz, U., Murali, T. M., Letovsky, S., Zheng, Y., Ding, C., Cantor, C. R., & Kasif, S. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307326101 · Cited by 315
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
Cross-species analysis of biological networks by Bayesian alignment
Berg, J., & Lässig, M. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0602294103 · Cited by 146
Kellis, M., Patterson, N. J., Birren, B. W., Berger, B., & Lander, E. S. (2004) · Journal of Computational Biology · doi:10.1089/1066527041410319 · Cited by 113
Self-citationThe art of gene function prediction
Murali, T. M., Wu, C., & Kasif, S. (2006) · Nature Biotechnology · doi:10.1038/nbt1206-1474 · Cited by 80
Pairwise 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 high-throughput assay for Tn5 Tnp-induced DNA cleavage
Ason, B. L. (2004) · Nucleic Acids Research · doi:10.1093/nar/gnh080 · Cited by 34
Bader, J. S., & Chant, J. (2006) · Science · doi:10.1126/science.1123221 · Cited by 15
Cited by
struc2vec: Learning Node Representations from Structural Identity
Ribeiro, L. F. R., Saverese, P. H. P., & Figueiredo, D. R. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098061 · Cited by 1,011
An integrative approach to ortholog prediction for disease-focused and other functional studies
Hu, Y., Flockhart, I., Vinayagam, A., Bergwitz, C., Berger, B., Perrimon, N., & Mohr, S. E. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-357 · Cited by 848
Self-citationNetwork 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
Functional and evolutionary implications of gene orthology
Gabaldón, T., & Koonin, E. V. (2013) · Nature Reviews Genetics · doi:10.1038/nrg3456 · Cited by 643
Panorama of ancient metazoan macromolecular complexes
Wan, C., Borgeson, B., Phanse, S., Tu, F., Drew, K., Clark, G., Xiong, X., Kagan, O., Kwan, J., Bezginov, A., et al. (2015) · Nature · doi:10.1038/nature14877 · Cited by 546
Metadata
- Authors
- Singh, R., Xu, J., & Berger, B.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2008-09-02
- Volume
- 105
- Issue
- 35
- Pages
- 12763-12768
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2056124433
- Cited by
- 652
- References
- 24
- FWCI
- 8.56
- Type
- journal article
- Language
- en
- Open access
- green
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.