Abstract
Background
Modeling in systems biology is vital for understanding the complexity of biological systems across scales and predicting system-level behaviors. To obtain high-quality pathway databases, it is essential to improve the efficiency of model validation and model update based on appropriate feedback.
Results
We have developed a new method to guide creating novel high-quality biological pathways, using a rule-based validation. Rules are defined to correct models against biological semantics and improve models for dynamic simulation. In this work, we have defined 40 rules which constrain event-specific participants and the related features and adding missing processes based on biological events. This approach is applied to data in Cell System Ontology which is a comprehensive ontology that represents complex biological pathways with dynamics and visualization. The experimental results show that the relatively simple rules can efficiently detect errors made during curation, such as misassignment and misuse of ontology concepts and terms in curated models.
Conclusions
A new rule-based approach has been developed to facilitate model validation and model complementation. Our rule-based validation embedding biological semantics enables us to provide high-quality curated biological pathways. This approach can serve as a preprocessing step for model integration, exchange and extraction data, and simulation.
Similar content being viewed by others
Background
Modeling in systems biology is vital for the system-level understanding of biological processes and predicting the behavior of the system at each level. To obtain high-quality pathway databases, many important databases are built by manual curation sometimes with the aid of computer. A typical curation process is well illustrated in [1]. First, biological information resources are collected from literature, background knowledge, and other databases.
To create and evaluate pathway models, the information is organized into the building blocks in pathway databases. After creating the pathways models, the domain experts validate the created pathways and the curators update them based on appropriate feedback. This validation and update are an iterative procedure to obtain the desired specific annotated pathway.
Biological pathways are abstract representation of experimental data. Ontology-based representations for biological pathways have emerged because such formats provide the advantages of defining and constraining diverse data [2, 3]. The pathway format is given in some representational language, while the generation of instance data is usually separated from ontology development. Although for the appropriate use of an ontology, formal definitions and informal documentation are given, it is sometimes difficult to avoid misassignment and misuse of ontology concepts. In the hierarchical structure of the ontology format, a more specific subclass should be selected instead of an upper class, such that a DNA binding process has at least one DNA as its participant. For the biological annotation, a suitable term should be selected from controlled vocabularies, such as cellular location for transcription. In addition, for dynamic models, more information which is usually not described in experimental data is required. Dimerization and polymerization need different stoichiometry coefficient. Likewise, there are important issues handled with care and they cannot be expressed formally in the ontology format. Based on this viewpoint, we are motivated to establish an ontology-based instance data validation tool.
Existing tools and inference engines [4–7] detect the misuse of features and check syntactic validation available in the ontology semantics. Ontology validation accomplishes generic ontology evaluation and debugging based on a schema and definitions for relationships in a conceptual model, such as logical consistency of the ontology, cardinality restriction, and subproperty axioms [8–10] On the other hand, there are some related works to complement knowledgebase by representing dynamics of the system, i.e., how to set relevant logical parameters for Petri net components [11, 12], predicting operons and missing enzymes in metabolic databases [13]. In such works, the focus is given on representing dynamics of the system by adjusting initial values and parameters for components. Another important work is to verify pathway knowledgebase in terms of event relationships [14]. Racunas et al. in [14] carried out the verification on the level of the logical combinations of events, but without checking the biological meaning of individual events.
As a complement to such efforts, we had proposed a validation method to correctly represent biological semantics and system dynamics for biological pathways. [15]. On the basis of the previous work, we developed a rule-based approach for validating ontology-based instance data. As an ontology-based format, Cell System Ontology (CSO) [16] is used, which can represent biological pathways for simulation and visualization in OWL (Web Ontology Language) [17]. We have defined 40 rules embedding biological semantics to constrain event-specific participants with cardinality, participant types, cellular location, and others properties. In particular, 36 biological events are formalized on the basis of shared knowledge underlying biological pathways defined in CSO. We believe that our approach extends the expressiveness of the ontology and complements biological pathways with necessary properties, which aims to provide high-quality curated pathway models.
Methods
We had defined three criteria for validating pathway models in terms of biological semantics and system dynamics as follows [15]:
Criterion 1 A structurally correct model to be a bipartite graph with two disjoint sets.
Criterion 2 A biologically correct model to represent the biological meaning of processes.
Criterion 3 A systematically correct model to capture generic behaviors that govern the system dynamics.
For the three criteria, a rule-based approach is applied for validating biological pathways. A rule in this case is a form of reactive rules, i.e. event-condition-action rules. When the event happens, the corresponding condition is evaluated and the action is executed. Some rules are a form of condition-action rules that directly evaluate the specified condition with no event. That is, if the condition is satisfied, then the action is applied. Please note that the event part in reactive rules is different from biological events. Each rule specifies a variety of relationships on the basis of biological events, and consists of OWL constructors and axioms [17]. The available constructors and their correspondence with SHOIQ class expression [18] are summarized in Table 1. Each letter in SHOIQ indicates S for smallest propositionally closed description logic with transitive roles, H for role hierarchy, O for nominals, I for inverse roles, and Q for qualified number restrictions, respectively.
Relations used in rules are in typewriter type and the details are as follows: unary relations are classes; binary relations in all capital letters are properties; and pre-defined terms (instances) in CSO and variables for instances are in italics.
Criterion 1: validation for structurally correct models
CSO uses an advanced Petri net named Hybrid Functional Petri net with an extension for the modeling and simulation of biological pathways [19]. In Petri nets, three elements, including place, transition, and arc, are defined. In order to be more intuitive for biological investigations, the Entity, Process, and Connector classes are used to denote place, transition, and arc element, respectively, in CSO. For the details of CSO and its schema, please refer to [16]. The relationship of the CSO classes and the Petri net elements is graphically summarized in Figure 1. The Entity class is used to represent objects, e.g. mRNA, protein, and small molecules. The Process class is used to represent biological events, e.g. phosphorylation, acetylation, and translocation. The relationship between Entity and Process is represented by the Connector class, i.e. indicating which entity is involved in a process.
In the Petri net architecture, an entity reflects the concentration of the substance and a process has a speed that depends on the concentration of the incoming entity. A connector transfers tokens from the input entity to the process or from the process to the output entity. Connector has several Petri nets related properties for simulation, such as initial value (concentration), minimum value, maximum value, and kinetics. Because of this reason, Connector is defined as a class in CSO. There are four types of connectors which imply the role of the involved entity in the process, including substrate, inhibitor, activator, and product.
We define that one entity can participate in a process with only one role. In other words, more than two connectors associated with the same pair of an entity and a process are not allowed. The valid connections among Process, Entity, and Connector are five types as shown in Figure 2. Process can have multiple Connectors and each connector can have only one Entity by definition in CSO. To constrain the relation among three classes, we defined a rule for detecting any invalid connection in the below.
Valid connections between Process and Entity via Connector. Legend for icons on the left: blue ovals for Entity, diamond for Process, and lines between Process and Entity for Connector. Each connection shows the type of the connector: (a) no connection; (b) InputProcessBiological for substrate; (c) InputInhibitorBiological for inhibitor; (d) InputAssociationBiological for activator; and (e) OutputProcessBiological for product.
The condition part checks whether there exist more than two connectors for a given pair of process and entity. If the condition is true, then perform the action. This rule requires user intervention to select a correct connector because it is difficult to decide which connector is correct without understanding the details of the interaction [15].
In the rule description, E, C, and A denote Event, Condition, and Action, respectively.
Rule for valid connection
E: Process(x1) Λ Entity(x2)
C: ¬ [Ǝ≤1x3 CONNECTOR(x1,x3) Λ {InputProcessBiological(x3) V InputInhibitorBiological(x3) V InputAssociationBiological(x3) V OutputProcessBiological(x3)} Λ ENTITY(x3,x2)]
A: alert
Criterion 2: validation for biologically correct models
Biological pathways consist of a series of interactions among entities. As described before, the Process class represents biological events each of which has characteristic features such as the type of molecules performing the event, the number of molecules involved, and the location which the event occurs. For example, autophosphorylation is a biological event to add a phosphate to a protein kinase by virtue of its own enzymic activity. Hence, autophosphorylation is different from phosphorylation because it occurs without any enzyme. Such definition is usually written in the natural language for the human users. To facilitate curation procedure, we defined four types of constraints for biological events which have specific requirements as follows:
Cardinality constraint A biological event needs constraints for the number of participating entities.
Type constraint A biological event needs a specific type of the entity, such as small molecule and DNA.
Property constraint An entity involved in a biological event needs to have a specific value for the property such as protein modification, cellular location, and stoichiometric coefficient.
Property relationship constraint For two entities involved in the same biological event, there needs a specific relationship between the values of the same property, such that two values should be same.
In this article, we have defined 36 rules for the 36 biological events. The 36 rules are divided into five groups depending on the necessary constraints for convenience. In the following rules, the action part will be different depending on the constraints in the condition part. Basically, the action is to show users an error message when the constraints are not satisfied. We use abbreviations as follows: hasInput(p1, e1) implies that a process p1 has an entity e1 which is connected to p1 via one of three input connectors InputAssociationBiological, InputInhibitorBiological, and InputProcessBiological; hasInputProcess(p1, e1) means that e1 is connected to p1 via InputProcessBiological; and hasOutput(p1, e1) means that e1 is connected to p1 via OutputProcessBiological. The types of connectors are already shown in Figure 2. For each e1, we called it as an input, inputprocess, output entity, respectively. In addition, for the pre-defined instances in CSO, the apostrophe prefix is used, such as ’FT_phosphorylated and ’ME_Binding. CSO provides pre-defined common vocabularies to annotate biological information. It allows to reuse existing structured information from other resources and to guide the allowable values for annotating biological information. Due to limitation of space, we list only several rules here. The formal description and full list of the rules are given in Additional file 1.
Group 1: rules that need cardinality and type constraints
Biological events in this group are required to have a specific type of an entity and/or a specific number of the entity. For example, DNA binding is defined as binding of a protein to the promoter/enhancer of a gene. The rule for DNA binding describes that there needs at least two more inputprocess entities; one of inputprocess entities has the type as Dna; and the product of DNA binding should have the type as Complex. Both Dna and Complex are subclasses of Entity in the hierarchy of CSO.
Rule for DNABinding
E: Process(x1) Λ BIOLOGICALEVENT(x1, ’ME_DNABinding)
C: ¬ [Ǝ≥2x2,Ǝ≥1x3 hasInputProcess(x1,x2) such that for one of x2s, Dna(x2) Λ hasOutput(x1,x3) Λ Complex(x3)]
Group 2: rules that need cardinality and SEQUENCEFEATURE property constraints
This group includes rules for the sequence relevant interaction such as post-translational modification. In the rules, hasFeature(x1,’x2) means that an entity x1 has a feature type as ’x2 where ’x2 is a predefined term for FeatureType.
Rule for Acetylation
E: Process(x1) Λ BIOLOGICALEVENT(x1, ’ME_Acetylation)
C: ¬ [Ǝ=1x2 , Ǝx3, Ǝx4, Ǝx5 hasInputProcess(x1,x2) Λ hasOutput(x1 ,x3) Λ Entity(x2) Λ Entity(x3) Λ hasFeature(x3, ’FT_Acetylated) Λ UNIFICATIONXREF(x2,x4) Λ UNIFICATIONXREF(x3,x5) Λ sameAs(x4,x5)]
The acetylation event generates a chemically acetylated protein that has its FEATURETYPE as ’FT_Acetylated. In the condition part, the external references for two entities, i.e, the values of UNIFICATIONXREF (x4 and x5) for the input x2 and output x3 entities, have to be the same because x3 is a modified form of x2
Rule for Autophosphorylation
E: Process(x1) Λ BIOLOGICALEVENT(x1,’ME_Autophosphorylation)
C: ¬ [Ǝ=1x2,Ǝx3, Ǝx4, Ǝx5, Ǝ=1x6 hasInputProcess(x1,x2) Λ hasOutput(x1,x3) Λ Entity(x2) Λ Entity(x3) Λ FEATURETYPE(x3, ’FT_Phosphorylated) Λ UNIFICATIONXREF(x2,x4) Λ UNIFICATIONXREF(x3,x5) Λ sameAs(x4,x5) Λ hasInput(x1,x6) Λ Entity(x6)]
For autophosphorylation, the condition part describes that the output entity is a phosphorylated form of the inputprocess entity when no enzyme is present. Two properties, hasInputProcess(x1,x2) and hasInput(x1,x6), imply that x2 and x6 are the same entity. The process has one output entity whose feature type is defined as ’FT_Phosphorylated.
Group 3: cardinality and STOICHIOMETRY property constraints
There are three events that indicate the chemical union of identical molecules. Depending on the definition in CSO, the stoichiometric coefficient of an inputprocess entity is 2 for dimerization, more than 2 and less than 21 for oligomerization, and more than 20 for polymerization.
In the below, the rule describes that it needs one inputprocess entity whose stoichiometry coefficient is equal to 2 and one output entity whose type is Complex.
Rule for Dimerization
E: Process(x1) Λ BIOLOGICALEVENT(x1,’ME_Dimerization)
C: ¬ [Ǝ=1x2,Ǝ=1x3,Ǝ=1x4 hasInputProcess(x1,x2) Λ Entity(x2) Λ hasStoichiometry(x2,x3) Λ (x3 = 2) Λ hasOutput(x1,x4) Λ Complex(x4)]
Group 4: rules that need cardinality and CELLCOMPONENT property constraints
In some biological events, cellular location of participating entities is important. For example, the internalization and nuclear export events are the movement of the inputprocess entity from extracellular/plasma membrane to cytosol, and from nucleoplasm to cytoplasm, respectively, while the translocation event requires that the inputprocess and output entities just have different cellular locations.
Rule for Internalization
E: Process(x1) Λ BIOLOGICALEVENT(x1, ’ME_Internalization)
C: ¬ [Ǝ=1x2, Ǝ=1x3, Ǝx4, Ǝx5 hasInputProcess (x1,x2) Λ Entity(x2) Λ CELLCOMPONENT(x2 , ’CC _Extracellul ar or ’CC _PlasmaMembrane) Λ UNIFICATIONXREF(x2 ,x4) Λ hasOutput(x1 ,x3) Λ Entity(x3) Λ CELLCOMPONENT(x3, ’CC _Cytosol) Λ UNIFICATIONXREF(x3,x5) Λ sameAs(x4,x5)]
It describes that one inputprocess entity should be located in extracellular or plasma membrane; one output entity should be located in cytosol; both entities x2 and x3 have the same external reference.
Group 5: rules that need cardinality, type, and CELLCOMPONENT property constraints
This group needs a specific type of an entity located in a specific cellular location. The transcription event is of copying information from DNA into new strands of mRNA. The constraints are that the type of the output entity is mRNA with cardinality 1; the location of the output entity is nucleoplasm. The gene expression, ion transport through ion channel, and translation events are included in this group.
Rule for Transcription
E: Process(x1) Λ BIOLOGICALEVENT (x1, ’ME_ Transcription)
C: ¬ [Ǝ=1x2 hasOutput(x1,x2) Λ mRNA(x2) Λ CELLCOMPONENT(x2, ’CC_Nucleoplasm)]
Criterion 3: validation for systematically correct models
CSO can represent the dynamics of biological pathways and is supposed to simulate complex molecular mechanisms at different levels of details. Once a mathematical model of biological pathways has been generated, it is necessary to estimate free parameters and unknown rate constants on the basis of the experimental data. In this paper, we limit our consideration to generating a simulatable model to be ready for evaluation and focused on protein turnover.
Normally, proteins are synthesized within the cell and over time are gradually broken down into individual amino acids, and this cycle is repeated. To capture this behavior, we define three rules to recognize the entities that are synthesized and degraded. For the entity that is not a product of any process, we add a pre-process that we assume generates the entity. On the other hand, for the entity that will be degraded, a degradation process is added to mimic biological degradation. In the Petri net formalism, adding a pre-process for such entity makes the pre-process to be fired without any constraints when the simulation is started, and the degradation process will consume the entity’s concentration. This complementation of the pathway model in CSO will help users to intuitively understand the given model and the way in which the model works when using Petri net based simulation tools such as Cell Illustrator (CI) [20–22].
In the following rules, the action part improves the given model by adding new instances (add-instance) and properties (add-property). The variable in braces, e.g. <x2>, denotes a new instance. Furthermore, the reverse properties are used, e.g. ENTITY–(x1,x4) is equal to ENTITY(x4,x1).
Rule for starting entities
C: Entity(x1) Λ ¬ Complex(x1) Λ ∀x4 {ENTITY–(x1,x4) Λ Input(x4)}
A: add-instance Process(<x2>), OutputProcessBiological(<x3>)
add-property BIOLOGICALEVENT(<x2>, ’ME_UnknownProduction), CONNECTOR(<x2> ,<x3>), ENTITY(<x3> ,x1)
A starting entity is an entity whose type is Entity, but not Complex which is a subclass of Entity, and is connected to a process only via Input connectors. Hence, if a given entity is a starting entity, then the action is to add a unknown production process <x2> and any necessary properties for it. This rule makes the starting entity be a product of the unknown production process.
Rule for starting complexes
C: Complex(x1) Λ ∀x5 {ENTITY–(x1,x5) Λ Input(x5)}
A: add-instance Process (<x2>), OutputProcessBiological(<x4>)
add-property BIOLOGICALEVENT(<x2>, ’ME_Binding), CONNECTOR– (<x4> ,<x2>)
for ∀x3 ENTITY(x1,x3) Λ Entity(x3) do add-property CONNECTOR– (x3,<xi>)
add-instance InputProcessBiological(<xi>)
A starting complex is a starting entity whose type is Complex. For a starting complex, we assume that the complex is generated via a binding process. In the action part, a binding process is added and the components of the complex will be the participants of the binding process.
Rule for degrading entities
C: {Protein(x1) V Complex(x1) V mRNA(x1) V SmallMolecule(x1)} Λ ¬ {Process(x2) Λ BIOLOGICALEVENT(x2 , ’ME_UnknownDegradation) Λ hasInputProcess(x2 ,x1)}
A: add-instance Process(<x3>), InputProcessBiological(<x4>)
add-property BIOLOGICALEVENT(<x3>, ’ME_ UnknownDegradation), CONNECTOR(<x3> ,<x4>)
add-property ENTITY(<x4>,x1)
For Protein, Complex, mRNA, and SmallMolecule, if a degradation process is not presented, a unknown degradation process is added.
Results
In order to implement the proposed rule-based system, we used AllegroGraph 3.1 [23] for the CSO data storage and query engine. AllegroGraph is an RDF (Resource Description Framework) graph database with support for SPARQL (SPARQL Protocol and RDF Query Language) [24] as a query language. Query manipulation and CSO data manipulation stored in AllegroGraph are carried out using Protege OWL API [25] and Jena [26]. This system is applied to macrophage models that are manually curated and created by using Cell Illustrator (CI) which is a tool to graphically model and simulate cellular processes.
Scientific publications reflecting the results of biological experiments and including the keywords: Lipopolysaccharide (LPS), phorbol 12-myristate 13-acetate (PMA), macrophage, and signal transduction pathway, were searched from PubMed [27]. A total of 96 publications were selected and modeled by curators. One model was based on a single publication. Basic guidelines on how to create and curate models on CI were provided to the curator. The created model was stored in Cell System Markup Language (CSML) as a default format in CI and exported into CSO.
Types of warnings
Our validation method was applied to the 96 macrophage models that contained a total of 4910 processes and 7155 entities. The warnings appeared if the expected value in the condition part is not correct or not defined. Table 2 shows the warning description and its frequency in the first and second columns, respectively.
The macrophage models did not violate the rule for structurally correct models in criterion 1. The reason for this is that the macrophage models were generated by CI, which supports the drawing of Petri net-based models via graphic tools and has the ability to check the connections between processes and entities. Criterion 1 is useful for validating translated data from other databases which have different schemata to CSO like BioPAX2CSO [15, 28]. The warnings related to criteria 2 and 3 are given in Table 2.
As described in Methods, the validation rules for criterion 2 generate warnings if a process does not satisfy its constraints. Among of the four constraints in Methods, the cardinality constraint is useful to detect other related problems. If an appropriate entity is not defined, then the related properties of the entity are not satisfied, either. For the property constraint, the FEATURETYPE property is needed for all post-translational modified entities. We found that it was not well guided to curators before curation. The value of this property will be given easily because each rule in group 2 show one-to-one mapping between two properties, BIOLOGICALEVENT and FEATURETYPE. The UNIFICATIONXREF property is used to uniquely identify biological entities. It is important not only for ontology instance data validation, but also for data integration such as model comparison and model merging. Currently, a biological entity is identified by external references that give additional information for the entity. In this work, we use TRANSPATH [29] as a main reference because it provides a comprehensive hierarchy for molecules and distinguishes between different species of the same molecule and between modified and unmodified forms of a protein, which is not supported by other databases [30, 31]. For the new molecules to TRANSPATH, especially for modified or complex molecules, it takes time to identify whether the entities have the same basic molecule. We will improve this procedure to reduce the search time.
On the other hand, the rules in criterion 3 directly manipulate the models if the condition part is satisfied. The rules include the action part to complement a given model by adding unknown production processes for starting entities, binding processes for starting complexes, and unknown degradation processes for degrading entities.
From the results, it is useful to analyze the relationship between biological events and warnings to know which points demand careful attention. This feedback is used to give guidelines to curators again.
A total of 44 biological events are used in the 96 macrophage models. Rules are not defined for 8 biological events such as cleavage and unknown interaction, because they have no specific characteristics to distinguish them from others. Such event terms occurred 136 times, which accounts for 2.8% of the processes in the 96 models. As described in Methods, for criterion 2, the 36 rules are divided into the five groups, each of which has same or similar constraints. Table 3 shows the frequency of each biological event occurred in the 96 models, the number of warnings during validation, and the reasons for the warnings. The biological events are listed by the order of rules in the five groups for criterion 2. In the third column, the warnings are counted on the basis of a process and its connected entities. The last column shows the reasons for the warnings per biological event and frequencies in parentheses, except for warnings related to FEATURETYPE and UNIFICATIONXREF properties. For example, ME_ADPRibosylation in group 2 occurred two times in the given models. Among the seven warnings, only one was related to the number of input entities.
What is corrected by validation?
We checked each model based on the warnings related to the cardinality constraint and corrected each model by reviewing the literature used to generate the model. Two cases are selected to show how our validation approach facilitates to correct the macrophage models. In Figures 3 and 4, A and B indicate the original model and the corrected model after validation, respectively. The red boxes in the figures reveal the places in which the problem happened and the model is changed.
ME UnknownActivation violating cardinality constraint. Legend: A and B represent the original model and the corrected model after validation, respectively. The biological event causing warnings and the modified parts are in red boxes in the images. The same legend is used in Figure 4. From the literature, we found that Ras{active} acts as an activator of the process, not as an inputprocess entity. Then, the connector from Ras{active} to the process is changed to a dashed line with an arrow in B.
Case 1: Misassignment of the connector type. As shown in Figure 3, the ME_UnknownActivation event violates the cardinality constraint of inputprocess entities. This event term is used in case the mechanism by which leads to the activation of a molecule is unknown. In the rule for ME_UnknownActivation, the condition part describes that only one inputprocess entity is needed to activate. In Figure 3A, we found that there are two inputprocess entities and one of those entities plays a role as an enzyme. Therefore, the type of the connector between the activated Ras and the process is changed into InputAssociationBiological, which represents this event as the activated Ras-induced Raf1 activation as shown in Figure 3B.
Case 2: Misassignment of the biological event term. This case shows that one dimerization event also violates the cardinality constraint of inputprocess entities. By the rule, ME_Dimerization has only one inputprocess entity whose stoichiometric coefficient is 2. As shown in Figure 4A, the output entity is a complex M-CSF(2):M-CSF-1-R(2) generated by the binding of M-CSF(2):M-CSF-1-R to M-CSF-1-R. We found that the biological event term is assigned mistakenly. Then the term is changed from ME_Dimerization to ME_Binding as shown in Figure 4B.
Discussion and conclusions
To our knowledge, the validation of ontology-based instance data for biological pathways has not been addressed yet. Although the ontology schema is developed with documentation, the use of the ontology is usually separated from the development. The generation of data on the basis of the ontology schema is apt to contain misuse and misunderstanding of the ontology. Such errors are not detected by ontology validation carried out on the basis of the ontology schema. The error correction is usually done manually and is time consuming. As shown in Results, relatively simple rules can detect the errors in the model, such as misassignment and misuse of ontology concepts and terms and enhance the model to be ready for simulation.
Our rule-based validation enables us to provide pathway models that allow computational tools to explore the possible dynamic behavior of pathway components with considering biological meaning. If sophisticated adjustment of quantitative parameters is needed for simulation, the correct assignment of biological concepts and terms are essential for ontology based computational tools. Therefore, this approach can serve as a preprocessing step for model integration, exchange and extraction data, and simulation. In future work, we plan to develop this system as a plug-in for ontology editors, and modeling and simulating tools.
References
Viswanathan GA, Seto J, Patil S, Nudelman G, Sealfon SC: Getting Started in Biological Pathway Construction and Analysis. Plos Computational Biology 2008., 4(2): 10.1371/journal.pcbi.0040016
Bader G, Cary M: BioPAX - biological pathways exchange language level 2, version 1.0 documentation. 2005.
Karp P: An ontology for biological function based on molecular interactions. Bioinformatics 2000, 16(3):269–285. 10.1093/bioinformatics/16.3.269
The Protégé ontology editor and knowledge acquisition system[http://protege.stanford.edu/]
W3C RDF Validation Service[http://www.w3.org/RDF/Validator/]
Sirin E, Parsia B, Cuenca GB, Kalyanpur A, Katz Y: Pellet: A practical OWL-DL reasoner. Web Semantics 2007, 5(2):51–53.
RacerPro[http://www.racer-systems.com/]
Parsia B, Sirin E, Kalyanpur A: Debugging OWL ontologies. International World Wide Web Conference 2005, 633–640. full_text
Plessers P, Troyer O: Resolving inconsistencies in evolving ontologies. 3rd European Semantic Web Conference 2006, 200–214.
Wang H, Horridge M, Rector A, Drummond N, Seidenberg J: Debugging owl-dl ontologies: A heuristic approach. 4th International Semantic Web Conference 2005, 745–757.
Genrich H, Küffner R, Voss K: Executable Petri net models for the analysis of metabolic pathways. International Journal on Software Tools for Technology Transfer 2001, 3(4):394–404.
Peleg M, Yeh I, Altman R: Modelling biological processes using workflow and Petri Net models. Bioinformatics 2002, 18(6):825–837. 10.1093/bioinformatics/18.6.825
Caspi R, Foerster H, Fulcher C, Kaipa P, Krummenacker M, Latendresse M, Paley S, Rhee S, Shearer A, Tissier C, Walk T, Zhang P, Karp P: The MetaCyc Database of metabolic pathways and enzymes and the BioCyc collection of Pathway/Genome Databases. Nucleic Acids Research 2008, 36(Database issue):D623-D631.
Racunas SA, Shah NH, Fedoroff NV: A case study in pathway knowledgebase verification. BMC Bioinformatics 2006., 7(196):
Jeong E, Nagasaki M, Miyano S: Rule-based reasoning for systems dynamics in cell systems. Genome Informatics 2008, 20: 25–36. full_text
Jeong E, Nagasaki M, Saito A, Miyano S: Cell System Ontology: Representation for modeling, visualizing, and simulating biological pathways. In Silico Biology 2007., 7(55):
Smith M, Welty C, McGuinness D: OWL Web Ontology Language Guide. 2004.
Horrocks I, Sattler U: A Tableaux Decision Procedure for SHOIQ. Journal of Automated Reasoning 2007, 39(3):249–276. 10.1007/s10817-007-9079-9
Nagasaki M, Doi A, Matsuno H, Miyano S: A versatile Petri net based architecture for modeling and simulation of complex biological processes. Genome Informatics 2004, 15: 180–197.
Nagasaki M, Doi A, Matsuno H, Miyano S: Genomic Object Net: I. A platform for modelling and simulating biopathways. Applied Bioinformatics 2003, 2(3):181–184.
Nagasaki M, Saito A, Jeong E, Li C, Kojima K, Ikeda E, Miyano S: Cell Illustrator 4.0: A computational platform for systems biology. In Silico Biology 2010., 10(2):
Cell Illustrator Online[http://cionline.hgc.jp]
AllegroGraph[http://www.franz.com/]
SPARQL query language for RDF[http://www.w3.org/TR/rdf-sparql-query/]
The Protégé-OWL API[http://protege.stanford.edu/plugins/owl/api/]
PubMed[http://www.pubmed.gov/]
Jeong E, Nagasaki M, Miyano S: Conversion from BioPAX to CSO for System Dynamics and Visualization of Biological Pathway. Genome Informatics 2007, 18: 225–236. full_text
Krull M, Pistor S, Voss N, Kel A, Reuter I, Kronenberg D, Michael H, Schwarzer K, Potapov A, Choi C, Kel-Margoulis O, Wingender E: TRANSPATH: an information resource for storing and visualizing signaling pathways and their pathological aberrations. Nucleic Acids Research 2006, 1(34):D546-D551. 10.1093/nar/gkj107
The UniProt Consortium: The Universal Protein Resource (UniProt). Nucleic Acids Research 2008, 36: D190-D195. 10.1093/nar/gkn141
Flicek P, Aken B, Beal K, Ballester B, Caccamo M, Chen Y, Clarke L, Coates G, Cunningham F, Cutts T, et al.: Ensembl. Nucleic Acids Research 2008, 36: D707-D714. 10.1093/nar/gkm988
Acknowledgements
This article has been published as part of BMC Bioinformatics Volume 12 Supplement 1, 2011: Selected articles from the Ninth Asia Pacific Bioinformatics Conference (APBC 2011). The full contents of the supplement are available online at http://www.biomedcentral.com/1471-2105/12?issue=S1.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare they have no competing interests.
Authors' contributions
EJ and MN conceived the basic idea. KU and MN created the macrophage models to be evaluated. EJ defined the rules for the validation and implemented the rule-based system. EJ and MN evaluated the validation result and completed the manuscript. SM supervised the whole study. All authors read and approved of the final manuscript.
Euna Jeong, Masao Nagasaki contributed equally to this work.
Electronic supplementary material
Rights and permissions
Open Access This article is published under license to BioMed Central Ltd. This is an Open Access article is distributed under the terms of the Creative Commons Attribution License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Jeong, E., Nagasaki, M., Ueno, K. et al. Ontology-based instance data validation for high-quality curated biological pathways. BMC Bioinformatics 12 (Suppl 1), S8 (2011). https://doi.org/10.1186/1471-2105-12-S1-S8
Published:
DOI: https://doi.org/10.1186/1471-2105-12-S1-S8