Skip to main content

ANAT 3.0: a framework for elucidating functional protein subnetworks using graph-theoretic and machine learning approaches



ANAT is a Cytoscape plugin for the inference of functional protein–protein interaction networks in yeast and human. It is a flexible graphical tool for scientists to explore and elucidate the protein–protein interaction pathways of a process under study.


Here we present ANAT3.0, which comes with updated PPI network databases of 544,455 (human) and 155,504 (yeast) interactions, and a new machine-learning layer for refined network elucidation. Together they improve network reconstruction to more than twofold increase in the quality of reconstructing known signaling pathways from KEGG.


ANAT3.0 includes improved network reconstruction algorithms and more comprehensive protein–protein interaction networks than previous versions. ANAT is available for download on the Cytoscape Appstore and at

Peer Review reports


Advanced Network Analysis Tool (ANAT) [1, 2] is a graphical, Cytoscape-based [3, 4] tool for the inference of functional protein subnetworks in yeast and human. ANAT allows the user to analyze a process of interest in the context of a protein–protein interaction (PPI) network in four settings: (i) inferring an anchored network that connects a given set of target proteins (e.g., the results of a genome-wide screen to a designated anchor set of proteins that are thought to mediate the process under study); (ii) inferring a general network that connects a given set of proteins to each other; (iii) local exploration of the neighborhood of a given set of proteins, and (iv) finding the shortest paths between pairs of proteins.

ANAT’s main engine is an algorithm to reconstruct subnetworks that link protein nodes of interests (anchors) with target proteins (terminals). It relies on an assembled database of PPI networks, each of which can be viewed as a weighted graph G = (E,V), where E are the edges, representing PPIs, each of which is assigned with a reliability score, and V are the nodes, representing proteins. It optimizes the reconstruction of a connected subgraph H(VH,EH) connecting anchors with terminals by simultaneously optimizing the global weight of the resulting network (sum of weights of the edges in EH) and the local length of the shortest path connecting each terminal to one of the anchors. The algorithm is governed by the 0 < α < 0.5 parameter, which balances the local and global criteria. A value closer to 0 emphasizes the local criterion while a value closer to 0.5 emphasizes the global criterion, with α = 0.25, balancing both [2, 5].

Here we present ANAT3.0, an updated version of ANAT that refines the anchored subnetwork reconstruction engine using machine learning techniques. In addition, ANAT3.0 comes with updated PPI networks that integrate KEGG signaling pathways [6] and IntAct interactions [7].


ANAT is implemented as a Java-based plugin for Cytoscape 3.8 and above. The ANAT plugin can be downloaded at, together with installation instructions, documentation, the user manual and sample inputs and outputs. It is also available on the Cytoscape App Store.

Materials and methods

For ANAT 3.0, IntAct [7] database interactions were merged with the BioGRID [8] interactions. Since the experimental detection methods (which are used as a feature to assign scores to the final base network in ANAT) for interactions that appeared in both databases were not always concordant, the lowest common ancestral experimental detection method from the PSI-MI ontology was used to represent each such interaction. A total of 109,261 new IntAct interactions (67,864 for human and 41,397 for yeast) were added to the ANAT base PPI network. In addition, we integrated KEGG human and yeast signaling pathways into ANAT base network, by translating the pathways from the KEGG format described in [6] to the ANAT format, by using KEGG proteins as nodes (disregarding small signaling metabolites like PIP3 and decomposing KEGG protein groups into fully connected subnetworks) and protein–protein interactions as edges. All KEGG edges were given a uniform confidence score of 0.6, following consistent rules from [2] of fixed confidence scores for non-experimental data, and the results were merged together with the background network of ANAT, resulting in 2301 new H. sapiens interactions and 1003 new S. cerevisiae interactions.

The main addition to ANAT's anchored reconstruction algorithm is a machine-learning layer that evaluates candidate proteins predicted by the algorithm and scores them according to their likelihood to appear in the true pathway being sought. To this end, ANAT3.0 exploits known signaling pathways from KEGG. All the nodes (representing KEGG pathway proteins) for each of the 37 (H. sapiens) and 20 (S. cerevisiae) signaling pathways were concatenated together in a training set and, subsequently, 5 features were obtained for each node as follows: anchors and terminals were extracted individually for each individual pathway by taking KEGG pathway nodes with no inward or no outward edges, respectively. These were used to run ANAT2.0 three times, with three different values of α = {0, 0.25, 0.5}, for every pathway. The output of a single ANAT run contains a list of nodes, each one of them coming with a confidence value, calculated as the percentage of different solutions containing the given node. The first three features of ANAT3.0’s machine learning layer are the confidence values for the given protein, for the three alpha values.

The next set of features represents the proximity of the node to the anchors and terminals, respectively, evaluated using a network propagation calculation [9]. Two network propagations were initialized from anchors and terminals of all pathways, by setting all nodes in the ANAT network to an initial value of 0, and starting nodes with value 1/(number of starting nodes). This yielded two network propagation coefficients for every node in every pathway, which were used as two additional features. If one node is present in more than one KEGG pathway, it will be present twice in the training set, as two different feature vectors. Labels are then assigned to each sample by comparing it to the original KEGG pathways. Finally, eventual KEGG pathway nodes not output by ANAT2.0 are added as an all 0 feature vector with label = 1.

All features were normalized to have mean 0 and variance 1. All nodes vectors were concatenated together to form the input matrix, which was then fed to a random forest classifier using python3's sklearn module with default parameters.

The margin parameter in ANAT2.0 controls the percentage of deviation from the optimum solution to include (a margin of 1.2 will include solutions of 20% deviation from the optimum) [2]. The higher the margin, the bigger the final output network. The aforementioned pipeline was run 6 times, to tune the margin parameter, with 6 different margin values m = {1, 1.2, 1.4, 1.6, 1.8, 2}, and AUC from ROCs and Precision Recall Curves were calculated to select the best model.

The resulting machine learning framework is then applied to a set of features generated for any input of anchors and terminals, and normalized to a standard distribution. The final output of ANAT3.0 is a minimum spanning tree connecting the resulting nodes, each of which is assigned with a confidence score.

Results and conclusions

In this updated version, which integrates information from BioGrid, IntAct and KEGG, the ANAT human network contains 544,455 interactions and the yeast network has 155,504 interactions. A total of 1026 ANAT2.0 simulations and 114 network propagations were run, for 57 KEGG pathways (37 for H. sapiens and 20 for S. cerevisiae), with 3 alpha values over 6 margin values m = {1, 1.2, 1.4, 1.6, 1.8, 2}.

5 features were obtained, and for each margin, a random forest classifier was then trained using alternatively (i) all 5 features together (ii) only ANAT2.0’s confidence values (3 features) (iii) only network propagation coefficients from anchors and terminals (2 features), and ROC and precision recall were assessed for all of them with a fivefold cross validation. The performance of a single ANAT2.0 run with the default setting of α = 0.25 was evaluated alongside the new model.

The values of AUC for all different setups across different margin values are summarized in Fig. 1. Looking at AUROC and AUPRC values, the margin with the best overall score is m = 1. For m = 1, AUROC for the standard ANAT2.0 was about 0.4, and the AUPRC 0.5. Using network propagation values alone, increased the AUCs to around 0.70 and 0.94, while using all confidence values for the 3 alpha values increased the two AUCs to 0.9, and 0.98, respectively, and using all features together gave a final AUROC of 0.97 and an AUPRC of 0.99. In summary, the new ANAT3.0 classification improved the AUC for both ROC and Precision vs Recall curves from around 0.5 to over 0.95 using a random forest with margin m = 1 and all 5 features, yielding highly accurate predictions.

Fig. 1
figure 1

AUC values (y axis) for different runs of ANAT3.0, with different sets of features, across ANAT margin values from 1.0 to 2.0 (x axis)

The machine learning framework can be applied to any given input by generating the five features, normalizing them and applying the trained classifier. The final output of ANAT3.0 is a minimum spanning tree connecting the resulting nodes, each of which is assigned with a confidence score. This yields a refined network structure where nodes are assigned with confidence values using the trained classifier.


From the ANAT sidebar on Cytoscape, select “new subnetwork” → “anchored network”, and select the organism of interest (H. sapiens or S. cerevisiae), and click “next”. In the next screen, input the names of anchors and terminals, then click on “advanced”, select “ML-based”, and click “finish” (Fig. 2).

Fig. 2
figure 2

A ANAT user interface with highlighted steps to run the machine-learning optimization. B ANAT3.0 output example using anchors and terminals from [10]

Availability and requirements

Project name: ANAT 3.0. Project home page: Operating system(s): Operates on all major operating systems. Programming language: Java, Python3. Other requirements: Cytoscape 3.8 and above. License: Free for academic use. Any restrictions to use by non-academics: License needed.

Availability of data and materials

KEGG pathway data is available at IntAct interaction data is available at



Area under the curve.


Area under the precision vs recall curve.


Area under the receiver operating curve.


Protein–protein interaction


  1. Almozlino Y, Atias N, Silverbush D, Sharan R. ANAT 2.0: reconstructing functional protein subnetworks. BMC Bioinform. 2017;18:1–5.

    Article  Google Scholar 

  2. Yosef N, Zalckvar E, Rubinstein AD, Homilius M, Atias N, Vardi L, Berman I, et al. ANAT: a tool for constructing and analyzing functional protein networks. Sci Signal. 2011;4:p11.

    Article  Google Scholar 

  3. Lotia S, Montojo J, Dong Y, Bader GD, Pico AR. Cytoscape app store. Bioinformatics. 2013;29:1350–1.

    Article  CAS  Google Scholar 

  4. Shannon P, Markiel A, Ozier O, Baliga NS, Wang JT, Ramage D, Amin N, Schwikowski B, Ideker T. Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res. 2003;13:2498–504.

    Article  CAS  Google Scholar 

  5. Yosef N, Ungar L, Zalckvar E, Kimchi A, Kupiec M, Ruppin E, Sharan R. Toward accurate reconstruction of functional protein networks. Mol Syst Biol. 2009;5:248.

    Article  Google Scholar 

  6. Kanehisa M, Goto S. KEGG: kyoto encyclopedia of genes and genomes. Nucleic Acids Res. 2000;28:27–30.

    Article  CAS  Google Scholar 

  7. Orchard S, Ammari M, Aranda B, Breuza L, Briganti L, Broackes-Carter F, Campbell NH, et al. The MIntAct project—IntAct as a common curation platform for 11 molecular interaction databases. Nucleic Acids Res. 2014;42:D358–63.

    Article  CAS  Google Scholar 

  8. Oughtred R, Stark C, Breitkreutz BJ, Rust J, Boucher L, Chang C, Kolas N, et al. The BioGRID interaction database: 2019 update. Nucleic Acids Res. 2019;47:D529–41.

    Article  CAS  Google Scholar 

  9. Cowen L, Ideker T, Raphael BJ, Sharan R. Network propagation: a universal amplifier of genetic associations. Nat Rev Genet. 2017;18:551.

    Article  CAS  Google Scholar 

  10. Farhan H, Wendeler MW, Mitrovic S, Fava E, Silberberg Y, Sharan R, Zerial M, Hauri HP. MAPK signaling to the early secretory pathway revealed by kinase/phosphatase functional screening. J Cell Biol. 2010;189:997–1011.

    Article  CAS  Google Scholar 

Download references


Not applicable.


This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 859962.

Author information

Authors and Affiliations



RS conceived the software development and participated in the algorithmic design. LFS and TA designed the algorithmic solutions and wrote the code. All authors drafted the manuscript. All authors have read and approved the manuscript.

Corresponding author

Correspondence to R. Sharan.

Ethics declarations

Ethics approval and consent to participate

Not applicable.

Consent for publication

Not applicable.

Competing interests

The authors declare that they have no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit The Creative Commons Public Domain Dedication waiver ( applies to the data made available in this article, unless otherwise stated in a credit line to the data.

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Signorini, L.F., Almozlino, T. & Sharan, R. ANAT 3.0: a framework for elucidating functional protein subnetworks using graph-theoretic and machine learning approaches. BMC Bioinformatics 22, 526 (2021).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: