NETAL: a new graph-based method for global alignment of protein–protein interaction networks
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Motivation: The interactions among proteins and the resulting networks of such interactions have a central role in cell biology. Aligning these networks gives us important information, such as conserved complexes and evolutionary relationships. Although there have been several publications on the global alignment of protein networks; however, none of proposed methods are able to produce a highly conserved and meaningful alignment. Moreover, time complexity of current algorithms makes them impossible to use for multiple alignment of several large networks together. Results: We present a novel algorithm for the global alignment of protein–protein interaction networks. It uses a greedy method, based on the alignment scoring matrix, which is derived from both biological and topological information of input networks to find the best global network alignment. NETAL outperforms other global alignment methods in terms of several measurements, such as Edge Correctness, Largest Common Connected Subgraphs and the number of common Gene Ontology terms between aligned proteins. As the running time of NETAL is much less than other available methods, NETAL can be easily expanded to multiple alignment algorithm. Furthermore, NETAL overpowers all other existing algorithms in term of performance so that the short running time of NETAL allowed us to implement it as the first server for global alignment of protein–protein interaction networks. Availability: Binaries supported on linux are freely available for download at http://www.bioinf.cs.ipm.ir/software/netal. Contact: sh.arab@modares.ac.ir Supplementary information: Supplementary data are available at Bioinformatics online.
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
Mass spectrometry-based proteomics
Aebersold, R., & Mann, M. (2003) · Nature · doi:10.1038/nature01511 · Cited by 6,955 · cited 2×
“…techniques including yeast two-hybrid (Fossum et al ., 2009; Parrish et al ., 2007; Stelzl et al ., 2005) and protein co-immunoprecipitation (Aebersold and Mann, 2003) that demonstrate large-scale protein–protein interactions (PPIs) for organisms, including Saccharomyces cerevisiae…”
BackgroundMethodLocal Graph Partitioning using PageRank Vectors
Andersen, R., Chung, F., & Lang, K. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.44 · Cited by 967
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 · cited 1×
“…., 2005) and protein co-immunoprecipitation (Aebersold and Mann, 2003) that demonstrate large-scale protein–protein interactions (PPIs) for organisms, including Saccharomyces cerevisiae (Collins et al ., 2007), Homo sapiens (Radivojac et al ., 2008) and Drosophila melanogaster (Giot et al ., 2003).”
Background
Cited by
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
“One-to-one network aligners (Singh et al. 2007; Kuchaiev et al. 2010; Milenković et al. 2010; Aladağ and Erten 2013; Neyshabur et al. 2013; Saraph and Milenković 2014; Craw-ford and Milenković 2015) find only one mapping between any two given node pairs.”
Background
Metadata
- Authors
- Neyshabur, B., Khadem, A., Hashemifar, S., & Arab, S. S.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2013-05-21
- Volume
- 29
- Issue
- 13
- Pages
- 1654-1662
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2155834877
- Cited by
- 185
- References
- 3
- FWCI
- 6.59
- 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.