The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Optimal Network Alignment with Graphlet Degree Vectors
Open accessAbstract
Important biological information is encoded in the topology of biological networks. Comparative analyses of biological networks are proving to be valuable, as they can lead to transfer of knowledge between species and give deeper insights into biological function, disease, and evolution. We introduce a new method that uses the Hungarian algorithm to produce optimal global alignment between two networks using any cost function. We design a cost function based solely on network topology and use it in our network alignment. Our method can be applied to any two networks, not just biological ones, since it is based only on network topology. We use our new method to align protein-protein interaction networks of two eukaryotic species and demonstrate that our alignment exposes large and topologically complex regions of network similarity. At the same time, our alignment is biologically valid, since many of the aligned protein pairs perform the same biological function. From the alignment, we predict function of yet unannotated proteins, many of which we validate in the literature. Also, we apply our method to find topological similarities between metabolic networks of different species and build phylogenetic trees based on our network alignment score. The phylogenetic trees obtained in this way bear a striking resemblance to the ones obtained by sequence alignments. Our method detects topologically similar regions in large networks that are statistically significant. It does this independent of protein sequence or any other information external to network topology.
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
The structure of the nervous system of the nematode Caenorhabditis elegans
White, J. G., Southgate, E., Thomson, J. N., & Brenner, S. (1986) · Philosophical Transactions of the Royal Society of London. B, Biological Sciences · doi:10.1098/rstb.1986.0056 · Cited by 5,589
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 interaction of TIGIT with PVR and PVRL2 inhibits human NK cell cytotoxicity
Stanietsky, N., Simic, H., Arapovic, J., Toporik, A., Levy, O., Novik, A., Levine, Z., Beiman, M., Dassa, L., Achdout, H., et al. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0903474106 · Cited by 3,524
A genomic regulatory network for development
Davidson, E. H., Rast, J. P., Oliveri, P., Ransick, A., Calestani, C., Yuh, C.-H., Minokawa, T., Amore, G., Hinman, V., Arenas-Mena, C., et al. (2002) · Science · doi:10.1126/science.1069883 · Cited by 1,567
Toward a Comprehensive Atlas of the Physical Interactome of Saccharomyces cerevisiae
Collins, S. R., Kemmeren, P., Zhao, X.-C., Greenblatt, J. F., Spencer, F., Holstege, F. C. P., Weissman, J. S., & Krogan, N. J. (2007) · Molecular & Cellular Proteomics · doi:10.1074/mcp.m600381-mcp200 · Cited by 795
Complex Spliceosomal Organization Ancestral to Extant Eukaryotes
Collins, L., & Penny, D. (2005) · Molecular Biology and Evolution · doi:10.1093/molbev/msi091 · Cited by 240
Sequence‐similar, structure‐dissimilar protein pairs in the PDB
Kosloff, M., & Kolodny, R. (2008) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21770 · Cited by 124
Cited by
Comparing 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
Integrative network alignment reveals large regions of global network similarity in yeast and human
Kuchaiev, O., & Pržulj, N. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr127 · Cited by 256
Self-citationCompact integration of multi-network topology for functional analysis of genes
Cho, H., Berger, B., & Peng, J. (2016) · Cell Systems · doi:10.1016/j.cels.2016.10.017 · Cited by 241
Girisha, M. N., Badiger, V. P., & Pattar, S. (2022) · Network Modeling Analysis in Health Informatics and Bioinformatics · doi:10.1007/s13721-022-00353-7 · Cited by 4
Metadata
- Authors
- Milenković, T., Ng, W. L., Hayes, W., & PržUlj, N.
- Venue
- Cancer Informatics
- Publisher
- SAGE Publications
- Published
- 2010-01
- Volume
- 9
- Pages
- CIN.S4744
- ISSN
- 1176-9351 (ISSN-L)
- OpenAlex
- W2092986233
- Cited by
- 193
- References
- 8
- FWCI
- 4.25
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimal Network Alignment with Graphlet Degree Vectors. https://app.cochat.ai/papers/10.4137/cin.s4744
- The paper
- Milenković, T., Ng, W. L., Hayes, W., & PržUlj, N. (2010). Optimal Network Alignment with Graphlet Degree Vectors. Cancer Informatics. https://doi.org/10.4137/cin.s4744
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.