- Open Access
STON: exploring biological pathways using the SBGN standard and graph databases
BMC Bioinformaticsvolume 17, Article number: 494 (2016)
When modeling in Systems Biology and Systems Medicine, the data is often extensive, complex and heterogeneous. Graphs are a natural way of representing biological networks. Graph databases enable efficient storage and processing of the encoded biological relationships. They furthermore support queries on the structure of biological networks.
We present the Java-based framework STON (SBGN TO Neo4j). STON imports and translates metabolic, signalling and gene regulatory pathways represented in the Systems Biology Graphical Notation into a graph-oriented format compatible with the Neo4j graph database.
STON exploits the power of graph databases to store and query complex biological pathways. This advances the possibility of: i) identifying subnetworks in a given pathway; ii) linking networks across different levels of granularity to address difficulties related to incomplete knowledge representation at single level; and iii) identifying common patterns between pathways in the database.
When modeling in Systems Biology and in Systems Medicine, the resulting data is often extensive, complex and heterogeneous. A visual representation can support users in data analysis and interpretation . However, the manual construction of such representations is a time-consuming task. In addition, the manual exploration of the visualized networks may not even be feasible due to the size. Recently, standards emerged for the representation of biological models in a consistent and reusable manner. The network for modeling in Computational Biology (COMBINE)  coordinates the development of such machine-readable standards and implements reliable and efficient model reuse. One of the COMBINE core standards is the Systems Biology Graphical Notation (SBGN)  for the visual representation of biological networks. It is widely used in Systems Biology and fills the previous gap of standardized visual representations for biological networks.
SBGN is composed of a set of three complementary languages: Process Description (PD), Activity Flow (AF) and Entity Relationship (ER). PD shows “all the molecular processes and interactions taking place between biochemical entities, and their results” . It creates detailed SBGN maps by representing hierarchical structures and biological complexes. AF “shows only influences such as ‘stimulation’ and ‘inhibition’ between the activities displayed by the molecular entities” . It is the most elementary of the SBGN languages. Finally, ER shows all “influences of entities upon the behaviour of others”, ignoring any temporal aspect . SBGN diagrams are drawn using three sets of standardized glyphs for the three SBGN languages. SBGN maps are represented in an XML-based format: the SBGN-ML , which is both human-readable and machine-readable. They can be exported from software tools such as SBGN-ED  (a VANTED add-on  with SBGN support) or CellDesigner . In this work, we consider only the PD and AF languages and propose to store biological networks as graph-oriented models in a graph database. We take existing biological models represented in SBGN-ML files as input and convert them into a graph representation. The novelty of our work lies in the fact that, for the first time, SBGN maps are stored in a structured way and thus can be queried and compared to each other.
Several studies show that graphs are realistic and well-suited for the representation of biological networks [9, 10]. Employing graph databases to store and explore biological models requires less effort and offers new insights into analyses . Our recent paper  describes the efficient storage of computational models in a graph database and informs on the improved interrogation of data relationships when represented as a graph. In that work, we show that it is more efficient to query SBML and CellML models based on their representation as a graph. One of the many interesting possibilities of applying the queries  is to highlight the important nodes in a network .
The Neo4j graph database  was chosen for the representation of biological pathways. Neo4j is a freely available, labelled property graph database. The concepts and associations among them are represented as nodes connected by edges (denoted in Neo4j as relationships). The Neo4j nodes and relationships can be categorized using the “Label” and “Type” features, respectively. Additional information about entities can be stored as attributes (denoted as properties). An example is given in Fig. 1. For access to the graph database, the Neo4j framework provides several APIs (for R, Java, Python programming languages) and integrates a web-based, intuitive graphical user interface. Integration and exploration of data within the database are realized using Cypher, a declarative language proposed by the Neo4j framework . Neo4j recently became a popular technology in different areas of computational biology . It is a key technology for model management tasks  and it was discussed as a mechanism to improve performances in network analysis . Further studies show that Neo4j performs well on distributed and heterogeneous data when compared to relational databases [19, 20]. It is especially true when the searches are String-based, which is the case for SBGN-ML documents.
The SBGN TO Neo4j (STON) framework is a graph-based tool to extend the existing infrastructure for storing and exploring biological pathways in SBGN-ML format. Our work provides a transformation from SBGN maps into a graph representation, thereby enabling: i) efficient management and querying of networks; ii) identification of subgraphs in networks; iii) merging of existing pathways into larger networks.
External libraries: LibSBGN and the Neo4j collection
STON is a standalone, Java-based framework that uses two sets of external libraries: LibSBGN  and a collection of Neo4j libraries. The latest version of STON 1.2 works with the LibSBGN milestone 2 and the Neo4j Community Edition version 2.3.1. The project and the source code are available on sourceforge , under the GNU General Public License version 2.0 (GPLv2).
LibSBGN provides access to SBGN through reading, writing and validation of SBGN-ML files and supports both, C++ and Java programming languages. The library offers several test files in the three SBGN languages. Test files contain small SBGN networks and are available for tool developers to check for SBGN compliance. The files are created by the developers of LibSBGN whenever new functionality is added to the languages. The LibSBGN project also provides example pathways to showcase the features of the SBGN specifications . We use LibSBGN to read SBGN-ML files and for validation.
The Neo4j libraries encode functionality for the Neo4j graph development (e. g., create nodes, relationships and properties), and provide access to the Neo4j database environment, including a web interface to query the data. STON converts existing SBGN PD and SBGN AF files into a Neo4j representation. As input, it takes a SBGN PD or a SBGN AF file, and a path to the Neo4j database location.
The STON framework then parses the SBGN-ML file and maps it on a graph structure (see Workflow section below). The graph representation, which is processable by Neo4j, is built according to the given SBGN-ML file; the location of the obtained graph has to be specified by the user (see Fig. 1). We ran STON with the test files available from LibSBGN, with the SBGN bricks examples , and with the iNOS (inducible Nitric Oxide Synthase) pathway  that we will use in the Results section to illustrate the possible applications of using STON.
The representation of biological pathways in graph databases requires translation rules. The SBGN-ML format already describes a graph-like structure: Glyph nodes (representing entities) interact with each other by means of glyph arcs (representing relations). The translation process has been facilitated by the similarity of SBGN-ML and Neo4j. SBGN glyph entities are nodes in Neo4j, and SBGN arcs are relationships. Additional information (e.g., ID, state variable, unit of information.) is retrieved as properties for Neo4j nodes and relationships.
Figure 1 exemplifies the translation of a small PD map: The SBGN diagram shows a receptor complex composed of four entities: a) the IFNGR1 macromolecule, b) the IFNGR2 macromolecule, c) the JAK1 macromolecule and d) the JAK2 macromolecule. For instance, the IFNGR1 macromolecule will be translated into a node with a label macromoleculemultimer and with properties Name equals IFNGR1 and UnitOfInformation equals N:2, indicating that this node is a dimer.
STON provides a mapping of all concepts from SBGN PD and SBGN AF. The list of translation rules and properties are available in the supplementary material (Additional file 1: Tables S1 and S3). We want to highlight two particular transformation rules, which lead to different representations in Neo4j than in the original SBGN. The first case involves complex glyphs in PD maps, composed of other biochemical entities called subglyphs. The complex and its entities will be represented as nodes and each node related to this complex will have a relationship belongs_to_complex targeting the complex node. Figure 1 illustrates the visualization of a complex based on the iNOS pathway (Additional file 2) in PD format and in Neo4j after translation. In the SBGN visualization, the complex glyph includes the entities. In Neo4j, we add a relationship (belongs_to_complex) between the entities and the complex node to connect them. The second case relates to auxiliary units in AF maps, representing complementary information specific to the SBGN biological activity structures. In Neo4j, this information is stored as a property of the corresponding biological activity node (Additional file 1: Table S2).
Neo4j offers different ways to access the stored data. First, a visual interface is provided by the Neo4j web server for human interaction. Users can start with a Cypher query and then continue to traverse the resulting graph and explore the nodes’ and relationships’ properties. In addition, the web server offers a REST API for programmatic access (at http://$server_name:7474/db/data/cypher). Using the exchange format JSON, one can send Cypher queries to the server’s data endpoint and receive a JSON encoded response (please refer to Additional file 3 for an example). On the developer’s side there are also possibilities to connect to the database using an implementation of the Neo4j Bolt driver in a language of choice . Once the driver established a connection one can use Cypher queries to traverse the database and map the results to objects. This way, data objects can directly be manipulated with a programming language. Lastly, an embedded Neo4j engine provides direct access the database and without the necessity of using Cypher. Here, Neo4j offers a variety of classes to traverse and manipulate database objects within the programming language.
STON supports modelers and researchers in their analysis of biological pathways. For the first time, pathways represented in the SBGN PD and AF languages are programmatically queryable.
We present three biological applications of the STON framework to exemplify how networks can be represented in the Neo4j graph database and later on be queried using Cypher. The first application is the identification of specific entities and their neighbors in the network. Second, we present a method to combine data represented on PD and AF levels. Third, we describe an approach for identifying common processes found in different networks using the example of the INOS pathway. The map was developed by integrating data from several studies (listed in ). It is composed of 81 glyphs and 59 arcs and contains most of the graphical elements found in SBGN PD (e.g., macromolecule, complex, simple chemical). It is furthermore easily translatable into SBGN AF. The iNOS pathway example is based on SBGN bricks, a set of basic biological patterns that can be combined to create larger maps .
1. Identifying entities in a network
When analyzing disease pathways, it is highly important to find disease-associated genes or substructures responsible to understand the organisation of a biological system and the underlying mechanisms . Therefore, for a given biological entity, it is necessary to identify functionally associated network neighbourhoods, i.e. to extract a target entity and its immediate neighbours from the graph. A reduction of the network’s complexity increases the knowledge about an entity’s environment. Using the Neo4j graph query facilities, we can find all occurrences of a specific entity together with its connected processes in the graph. As illustrated in Fig. 2, we identified subnetworks of IFNG in the iNOS pathway. We obtained the subnetworks by running a Cypher query in the Neo4j’s web interface (available in Additional file 3). The query traverses through each node in the graph until it matches the targeted one. The system then retrieves the neighbours. The example network in Fig. 2 shows how IFNG binds the IFNG receptor to form a complex which is then phosphorylated. The Cypher language is flexible and permits to customize queries. For example, users may adjust the depth of the subnetwork they would like to retrieve to explore the neighborhood of an entity. Users may also search for a specific structure, e. g., protein-reaction-protein structures, which is facilitated by the use of specific Cypher queries.
2. Linking levels of granularity
The linking of different levels of granularity allows researchers to compare biological networks at different levels of detail. In Systems Biology, it is highly beneficial to have access to computational tools that can return detailed information about processes occurring in complex biological networks by connecting information from multiple layers. By using the Neo4j graph database, we are able to link PD and AF diagrams. The purpose is to compare both levels and to help addressing the difficulties related to incomplete knowledge representation. When studying a complex network, for example, we may first be interested in getting an overview of the influences between the biological entities involved (AF level). At a later time, we may want to study the processes occurring in a network in more detail (PD level). To determine matching parts in the two networks, we use a Cypher query (Available in Additional file 3) to compare the network graphs and to retrieve links between their nodes. Figure 3 shows a set of links between the AF and PD versions of the iNOS pathway. The different parts of the maps are highlighted. For instance, at the PD level, the IFNG binds with the IFNG complex receptor to form a complex, which is then phosphorylated and will stimulate the process of STAT1alpha dimerization. At the AF level, the activation of STAT1alpha is represented more simplistically by IFNG and the receptor elements only.
3. Linking identical processes in two different SBGN PD diagrams
STON is capable of highlighting overlapping structures between two different metabolic graphs (PD level) by identifying and linking identical processes. Figure 4 illustrates two different versions of the iNOS pathway. The difference is located on the transcription of IRF1. Both maps show the processes triggered before transcription; however, while the first map focuses on the gene regulatory region GAS, the second one shows the gene IRF1. In order to connect the environment of the same process node among different maps, initially, STON compares relationships that are connected to the given process node and nodes that are connected to these relationships. Furthermore, processes are linked if and only if 1) relationships have the same effect (e.g., consumption, production, etc.) and 2) the following properties are identical for all nodes related to the corresponding relationships: NodeType, Name, UnitOfInformation, StateVariable, Compartment. When all these conditions are met, a relationship called identical_process is created. Linking identical processes helps to identify overlapping structures. Common processes between pathways can be highlighted to support the visual analysis of the biological system.
Many models today are represented using standards, including SBGN, and they are getting increasingly extensive. This situation requires new methods and tools for the management and exploration of models. In this paper, we show how the STON framework supports researchers with a visual, graph-based representation of large biological networks.
STON manages heterogeneous data at different levels of biological description by integrating i) various types of biological concepts including metabolites, proteins, complexes, genes, subcellular location, and ii) different types of processes such as metabolic reactions, signalling events and gene regulatory machinery. Once represented in a Neo4j database, the networks can be interrogated for different topics of interest using the Cypher query language. Cypher allows for structure-based queries that cannot be answered efficiently on the SBGN-ML file level, nor using SQL databases. We tested the capabilities of STON using a biological reference map from the KEGG pathway database : the large metabolic pathway (identifier number: ec01100) composed of 3814 nodes and 3633 relationships. The translation and storage of this network with STON takes approximately 10 minutes using an Intel ®; Core™ i7-3930K computer at 3.2GHz and 32GB of RAM (see Additional file 1: Table S3, and Additional file 4).
The modular implementation of the Neo4j framework allows to further extend STON to support the management of additional data types such as tissue-specific expression levels or drug target information for proteins. Another reason for the easy implementation of these extensions is the adaptability of the Neo4j schema. Similarly, the existing mapping from SBGN-ML into Neo4j can easily be adapted and extended by adding new relationships and node types to the database schema.
In the last few years there has been a growing interest in reconstruction of large disease networks. For example, the reconstruction of maps describing Alzheimer’s disease (AlzPathway, ) contains 1070 reactions. The map of Parkinson’s disease consists of 2045 entities , and the Atlas of Cancer Signalling Network has 4826 molecular processes . STON also enables the efficient combination of such networks thereby facilitating the identification of common substructures. It is known that functional modules are important factors in understanding the organization of a biological system. A longer-term research application could be the identification of similar substructures in two disease maps, based on the knowledge that disease-related genes are associated with a functional substructure in a certain disease map. This knowledge may give new insight into dysfunctional pathway components that are common in the two disease conditions. The Neo4j backend makes such structural queries efficient, even for large networks.
The semantic interpretation of links between identified subnetworks and the judgment how feasible these links are in a biological sense remain two open research questions (e. g., ). STON does not provide solutions to these questions but it is already capable of extracting meaningful and self-contained subgraphs from an existing network. When reusing the subgraphs as building blocks for other models, a decision must be made, whether or not the subgraphs are compatible. For example, one protein can exist in many different states and two different diagrams potentially could have two different states of the same protein. Do we merge p53 protein in the default unphosphorylated state with a p53 protein phosphorylated at serine 15? Another example is generic proteins (for example ERK) versus specific proteins (ERK1 or ERK2) in two different maps: do we make them a single entity or, if not, how do we show the relationships between generic and specific entities in the merged network? These are some of the current general challenges that need to be addressed by the Systems Biology community. For now, this is left to the user to ensure that two maps prepared for merging are compatible. A step towards automatic merging could be the evaluation of information obtained from the semantic annotations to terms in bio-ontologies. Currently the SBGN community discusses about storing IDs for entities in SBGN maps . By looking at ontologies, we could reduce uncertainties during the process of merging two maps. This approach, however, depends highly on the quality and specificity of annotations. A major hindrance in applying the approach is that the level of accuracy of annotation is often not sufficient to derive reliable conclusions .
STON is a framework that exploits the Neo4j graph database to store biological pathways. We mapped the SBGN standard (PD and AF levels) onto a Neo4j structure and we showed how STON enables i) the identification of subnetworks of interest, ii) the comparison of different layers of granularity in SBGN languages and iii) the merge of SBGN diagrams. STON provides new opportunities for managing and querying biological networks, as well as advanced manipulation of subnetworks. This will add to the infrastructure of tools for model management and exploration, which is necessary for efficient use of network approaches in Systems Biology and Systems Medicine.
Application program interface
COmputational modeling in biology network
Gamma activated sequence
Interferon gamma receptor 1
Interferon gamma receptor 2
Induced nitric oxide synthase
Interferon regulatory factor 1
Janus kinase 1
Janus kinase 2
Kyoto encyclopedia of genes and genomes
Management system for models and simulations
Random access memory
REpresentational state transfer
Systems biology graphical notation
Systems biology graphical notation markup language
Systems biology markup language
Systems biology ontology
Simulation experiment description markup language
Structured query language
Signal transducer and activator of transcription 1 alpha
SBGN TO Neo4j
Visualization and analysis of networks containing experimental data
Extensible markup language
Merico D, Gfeller D, Bader GD. How to visually interpret biological data using networks. Nat Biotechnol. 2009; 27(10):921.
Hucka M, Nickerson DP, Bader GD, Bergmann FT, Cooper J, Demir E, Garny A, Golebiewski M, Myers CJ, Schreiber F, et al. Promoting coordinated development of community-based information standards for modeling in biology: the COMBINE initiative. Front Bioeng Biotech. 2015; 3:19.
Le Novère N, Hucka M, Mi H, Moodie S, Schreiber F, Sorokin A, Demir E, Wegner K, Aladjem MI, Wimalaratne SM, et al. The systems biology graphical notation. Nat Biotechnol. 2009; 27(8):735–41.
Sorokin A, Le Novère N, Luna A, Czauderna T, Demir E, Haw R, Mi H, Moodie S, Schreiber F, Villéger A. Systems Biology Graphical Notation: Entity Relationship language level 1 version 2. J Int Bioinformatics. 2015; 12(264.10):2390.
Van Iersel MP, Villéger AC, Czauderna T, Boyd SE, Bergmann FT, Luna A, Demir E, Sorokin A, Dogrusoz U, Matsuoka Y, et al. Software support for SBGN maps: SBGN-ML and LibSBGN. Bioinformatics. 2012; 28(15):2016–21.
Czauderna T, Klukas C, Schreiber F. Editing, validating and translating of SBGN maps. Bioinformatics. 2010; 26(18):2340–1.
Rohn H, Junker A, Hartmann A, Grafahrend-Belau E, Treutler H, Klapperstück M, Czauderna T, Klukas C, Schreiber F. VANTED v2: a framework for systems biology applications. BMC Syst Biol. 2012; 6(1):1.
Funahashi A, Matsuoka Y, Jouraku A, Morohashi M, Kikuchi N, Kitano H. CellDesigner 3.5: a versatile modeling tool for biochemical networks. Proc IEEE. 2008; 96(8):1254–65.
Pavlopoulos GA, Secrier M, Moschopoulos CN, Soldatos TG, Kossida S, Aerts J, Schneider R, Bagos PG. Using graph theory to analyze biological networks. BioData Min. 2011; 4(1):1.
Lysenko A, Roznovăţ IA, Saqi M, Mazein A, Rawlings CJ, Auffray C. Representing and querying disease networks using graph databases. BioData Min. 2016; 9(1):23.
Johnson D, Connor AJ, McKeever S, Wang Z, Deisboeck TS, Quaiser T, Shochat E. Semantically linking in silico cancer models. Cancer Informat. 2014; 13(Suppl 1):133–43.
Henkel R, Wolkenhauer O, Waltemath D. Combining computational models, semantic annotations and simulation experiments in a graph database. Database (Oxford). 2015; 2015:130.
Dogrusoz U, Cetintas A, Demir E, Babur O. Algorithms for effective querying of compound graph-based pathway databases. BMC Bioinforma. 2009; 10(1):1.
Zhang JD, Wiemann S. KEGGgraph: a graph approach to KEGG PATHWAY in R and bioconductor. Bioinformatics. 2009; 25(11):1470–1.
The Neo4j Graph Database. http://www.neo4j.com/. Accessed 21 Oct 2016.
v, 3.0 edn; 2016. https://neo4j.com/docs/developer-manual/current/cypher/.
Have CT, Jensen LJ. Are graph databases ready for bioinformatics?. Bioinformatics. 2013; 29(24):3107–8.
Summer G, Kelder T, Ono K, Radonjic M, Heymans S, Demchak B. cyNeo4j: connecting Neo4j and Cytoscape. Bioinformatics. 2015; 31(23):3868–9.
Vicknair C, Macias M, Zhao Z, Nan X, Chen Y, Wilkins D. A comparison of a graph database and a relational database: a data provenance perspective. In: Proceedings of the 48th Annual Southeast Regional Conference. ACM: 2010. p. 42.
Holzschuher F, Peinl R. Performance of graph query languages: comparison of cypher, gremlin and native access in Neo4j. In: Proceedings of the Joint EDBT/ICDT 2013 Workshops. ACM: 2013. p. 195–204.
The STON Software. http://sourceforge.net/projects/ston/. Accessed 21 Oct 2016.
The SBGN Webpage: Specifications. https://sbgn.github.io/sbgn/specifications. Accessed 21 Oct 2016.
Junker A, Sorokin A, Czauderna T, Schreiber F, Mazein A. Wiring diagrams in biology: towards the standardized representation of biological information. Trends Biotechnol. 2012; 30(11):555.
The SBGN Bricks. http://www.sbgnbricks.sourceforge.net. Accessed 21 Oct 2016.
Neo, 4j: Language Guides. https://neo4j.com/developer/language-guides/. Accessed 21 Oct 2016.
Sharma A, Menche J, Huang CC, Ort T, Zhou X, Kitsak M, Sahni N, Thibault D, Voung L, Guo F, et al. A disease module in the interactome explains disease heterogeneity, drug response and captures novel pathways and genes in asthma. Hum Mol Genet. 2015; 24:3005–3020.
Kanehisa M, Goto S. KEGG: Kyoto Encyclopedia of Genes and Genomes. Nucleic Acids Res. 2000; 28(1):27–30.
Mizuno S, Iijima R, Ogishima S, Kikuchi M, Matsuoka Y, Ghosh S, Miyamoto T, Miyashita A, Kuwano R, Tanaka H. Alzpathway: a comprehensive map of signaling pathways of Alzheimer’s disease. BMC Syst Biol. 2012; 6(1):52.
Fujita KA, Ostaszewski M, Matsuoka Y, Ghosh S, Glaab E, Trefois C, Crespo I, Perumal TM, Jurkowski W, Antony PM, et al. Integrating pathways of Parkinson’s disease in a molecular interaction map. Mol Neurobiol. 2014; 49(1):88–102.
Kuperstein I, Bonnet E, Nguyen H, Cohen D, Viara E, Grieco L, Fourquet S, Calzone L, Russo C, Kondratova M, et al. Atlas of cancer signalling network: a systems biology resource for integrative analysis of cancer data with google maps. Oncogenesis. 2015; 4(7):160.
Petersen BK, Ropella GE, Hunt CA. Toward modular biological models: defining analog modules based on referent physiological mechanisms. BMC Syst Biol. 2014; 8(1):1.
SBGN Discussion List - “SBGN-ML: Standard Way to Keep IDs for Entities and PMIDs for Processes”. https://groups.google.com/forum/\#\!msg/sbgn-discuss/VMQ4b5yOJH8/4wAdDp4uDAAJ;context-place=forum/sbgn-discuss. Accessed 21 Oct 2016.
König M, Oellrich A, Waltemath D. Challenges and opportunities for system biology standards and tools in medical research. In: Proceedings of the ODLS 2016. CEUR WS: 2016. https://kclpure.kcl.ac.uk/portal/files/59024860/final_submission_odls_2016.pdf.
Authors would like to acknowledge for access to the neo4j 2.3.1 framework, the libSBGN library and the SBGN resources.
The research leading to these results has received support from the Innovative Medicines Initiative Joint Undertaking under grant agreement number IMI 115446 (eTRIKS), resources of which are composed of financial contribution from the European Union’s Seventh Framework Programme (FP7/2007–2013) and EFPIA companies’ in kind contribution. VT and DW were also supported by the BMBF e:Bio SBGN-ED+ project (FKZ 031 6181). RH received funding from the German Federal Ministry of Education and Research (BMBF) via grant number FKZ 031 A540A (de.NBI).
Availability of data and materials
Project name: STON
Project home page: https://sourceforge.net/projects/ston/
Operating systems: Linux, Mac OS, Windows
Programming language: Java
Other requirements: Neo4j and LibSBGN milestone 2
Any restrictions to use by non-academics: none.
VT designed and implemented the framework. AM conceived and supervised the project. JP, AM, IB, contributed to the design of STON. IB and RH advised on Neo4j. VT wrote the first draft of the manuscript. AM, DW and IB contributed to writing the manuscript. JP, MS, RH, CA reviewed the content of the manuscript. All authors revised and approved the final version of the manuscript.
The authors declare that they have no competing interests.
Consent for publication
Ethics approval and consent to participate
Supplementary material. This pdf file contains tables with translation rules of STON and a benchmark table on STON’s performances. (PDF 103 kb)
Visualization of the iNOS pathway in SBGN PD. This pdf visualizes the iNOS pathway that we designed from the www.sbgnbricks.sourceforge.net using the SBGN-ED tool. The IFNG forms a complex with the interferon gamma receptor. This will activate the phosphorylation of STAT1alpha. After homodimerization, STAT1alpha will bind to the gene IRF1 to activate the transcription of IRF1. This protein regulates the transcription of the iNOS protein, which will links Calmodulin to create a complex that will activate the synthesis of nitric oxide (NO). (PDF 83.4 kb)