- Open Access
Integration and publication of heterogeneous text-mined relationships on the Semantic Web
Journal of Biomedical Semantics volume 2, Article number: S10 (2011)
Advances in Natural Language Processing (NLP) techniques enable the extraction of fine-grained relationships mentioned in biomedical text. The variability and the complexity of natural language in expressing similar relationships causes the extracted relationships to be highly heterogeneous, which makes the construction of knowledge bases difficult and poses a challenge in using these for data mining or question answering.
We report on the semi-automatic construction of the PHARE relationship ontology (the PHArmacogenomic RElationships Ontology) consisting of 200 curated relations from over 40,000 heterogeneous relationships extracted via text-mining. These heterogeneous relations are then mapped to the PHARE ontology using synonyms, entity descriptions and hierarchies of entities and roles. Once mapped, relationships can be normalized and compared using the structure of the ontology to identify relationships that have similar semantics but different syntax. We compare and contrast the manual procedure with a fully automated approach using WordNet to quantify the degree of integration enabled by iterative curation and refinement of the PHARE ontology. The result of such integration is a repository of normalized biomedical relationships, named PHARE-KB, which can be queried using Semantic Web technologies such as SPARQL and can be visualized in the form of a biological network.
The PHARE ontology serves as a common semantic framework to integrate more than 40,000 relationships pertinent to pharmacogenomics. The PHARE ontology forms the foundation of a knowledge base named PHARE-KB. Once populated with relationships, PHARE-KB (i) can be visualized in the form of a biological network to guide human tasks such as database curation and (ii) can be queried programmatically to guide bioinformatics applications such as the prediction of molecular interactions. PHARE is available at http://purl.bioontology.org/ontology/PHARE.
A large amount of biomedical knowledge is in the form of text embedded in published articles, clinical files or biomedical public databases. In order to construct computable knowledge bases from these sources, there is a great interest in capturing and formalizing this knowledge. The capture of relationships between biological entities is of particular interest since such relationships represent elementary and reusable knowledge units—often called “nano-publications” .
Our work is motivated by the need for automated approaches capturing and formalizing knowledge extracted from the literature via manual or computational approaches. Consider for example, that five curators at the Pharmacogenomics Knowledge Base (PharmGKB) manually browse the pharmacogenomics (PGx) literature to curate relationships relevant for storage in the PharmGKB . The result of this curation process is a high quality database queried by clinicians and bioinformaticians. Nevertheless this manual curation process is not sustainable considering the growth of the scientific literature in this domain . Automatic approaches using Natural Language Processing (NLP) are therefore increasingly utilized .
The simplest methods to capture relationships rely on co-occurrence of two entities to derive a relation between them. For example, in the sentence “Our study shows that warfarin inhibits the expression of VKORC1” a drug, warfarin, and a gene, VKORC1, can be recognized using simple lexicons. The co-occurrence of these two entities in one or more sentences is used to derive a relation of the form (warfarin, VKORC1).
One key limitation of the co-occurrence based approach is identification of false positive connections. For example the sentence “Warfarin inhibits the expression of VKORC1 while sulfamethoxazole inhibits the expression of CYP2C9” would provide co-occurrence counts towards four relationships including the relationships (warfarin, VKORC1) and (warfarin, CYP2C9); only one of which is true. A second limitation is the coarse granularity of the identified relationships. Considering the previous example, the mentioned relationship links warfarin and the expression of VKORC1, and not VKORC1 per se. We consider this distinction of importance since VKORC1 and expression of VKORC1 refer to a gene and a phenotype respectively—two very distinct entities. Despite these limitations, co-occurrence is successfully used to generate networks including protein-protein interaction networks, gene-disease networks and regulatory gene expression networks [5, 6]. Most of these networks are hard to compute on since their representation format does not support queries with typed relationships and the semantics associated with the nodes and edges differ in every network.
Other NLP approaches can identify typed relationships and recognize entities that can either be the whole or a part of a subject and an object [7–9]. For example processing the previous sentence can identify the following relationship inhibits(warfarin, the expression of VKORC1) — that can also be represented as inhibits (warfarin, VKORC1 expression). Figure 1 shows three levels of granularity commonly encountered in text-mined relationships. Fine-grained relationships can be identified via syntactic parsing of sentences, which generates structures such as Parse Trees or Dependency Graphs (DG) . In previous work, we presented a method based on syntactic parsing and DG exploration to extract fine-grained PGx relationships . Given the variation in natural language, it is difficult to normalize the fine-grained and typed relationships extracted by this method. In this paper, we report on the construction of a relationship ontology and describe its use for integrating and publishing text-mined relationships on the Semantic Web. The relationships captured as instances of the PHARE ontology can be queried using Semantic Web technologies such as SPARQL and can be visualized in the form of a biological network. Semantics associated with relationships declared in PHARE-KB allow the text-extracted relationships to be consumed both by humans (for example, to guide curation) as well as by machines (for example, to guide computational prediction of molecular interactions).
In previous work, we described the extraction of over 40,000 raw relationships in the domain of pharmacogenomics from MEDLINE abstracts . In following sections we briefly summarize this extraction process and then describe how we use the PHARE ontology we have created to normalize and integrate these relationships.
Relationships and PGx relationships
We define a relationship as a binary relation R (a, b), where a, and b are subjects and objects related by a relationship of type R. In PGx relationships a and b can be instances of a gene (e.g., VKORC1 gene), drug (e.g., warfarin), or phenotype (e.g., clotting disorder). We note that a and b can also be entities that are related to genes (e.g., VKORC1 expression), drugs (e.g., warfarin dose) or phenotypes (e.g., clotting disorder treatment). R is a type of relation described by words such as “inhibits”, “transports”, or “treats” and their synonyms.
The three key entities in PGx (genes, drugs, and phenotypes) can be either direct targets for relation extraction, or indicators of latent PGx knowledge, as they modify other entities to create a second set of entities necessary to precisely describe PGx relationships. We refer to these modified entities as composite entities in contrast with the key entities. These composite entities can be any biomedical entity, such as a gene variation, drug effect, or disease treatment. For example, the gene entity VKORC1 (a key entity) is used as a modifier of expression in “warfarin inhibits the expression of VKORC1.” Specifically, composite entities are composed of a sequence of terms that can be read left to right and where left term progressively specializes the term on its right. The last word is named the head entity. Figure 2 shows the components of relationships.
Identification of a sentence with PGx relationships
Given the definition of PGx relationships, a sentence that potentially contains a PGx relationship would mention a gene and drug, a gene and a phenotype, or a drug and a phenotype. We used a Lucene index created on individual sentences of MEDLINE abstracts published before 2009 (17,396,436 abstracts and 87,806,828 sentences) processed by Xu et al. to identify those sentences that might contain a PGX relationship [12, 13]. To select only sentences that potentially mention a PGx relationship we queried the index with pairs of key PGx entities (only gene-drug and gene-phenotype pairs) for sentences that are indexed with both the terms in the query. The PharmGKB lexicon, provides the sets of synonyms used to build such queries for the key entities. Overall, for this study we used 41 genes highlighted by PharmGKB as key, well characterized pharmacogenomic genes , as well as 3,007 drugs and 4,202 phenotypes. Future work will expand the relationship extraction to all genes.
Extraction of heterogeneous raw relationships
Sentences returned by the index are parsed using the Stanford Parser to build Dependency Graphs (DGs) . DGs are rooted, directed, and labelled graphs, where nodes are words and edges are dependency relations between words (e.g., noun modifier, nominal subject). The extraction of raw relationships of the form R(a,b) relies on the exploration of syntactic structure provided by DGs where:
- a and b are nodes or chains of nodes in a DG, depending on whether they are a single key entity (an instance of gene, drug or phenotype) or a composite entity;
R is a node in the DG that connects a and b, and indicates the nature of their relationship.
We have developed an algorithm to explore the DG and extract raw relationships from the raw text. The extraction of raw relationships is constrained by a set of rules defined using the different type of dependencies that associate nodes in DG. This step results in the extraction of over 40,000 raw relationships discussed in . These relationships are highly heterogeneous and contain multiple equivalent ways to express one single fact. The details of the DG exploration algorithm appear in Table 1 of .
Building the PHArmacogenomic RElationship ontology
In order to create a smaller, normalized set of relationships, we first identified the 200 most frequent relationship types from the ~40,000 raw relationships. In the next step, we manually merged similar relationships and organized them hierarchically. Groups of similar relationships are used to define roles in the PHARE ontology. For example Figure 3 shows how inhibit, repress, and antagonize are merged to define the role inhibits. Role labels are declared using the rdfs:label annotation property. The first label of each role is used as its preferred name. Please note that the symbol $$ is a simple separator symbol that enables us to distinguish the passive voice from the simple past during the next normalization step.
In a similar manner we identified the 200 most frequent terms modified by key entities (e.g., expression for gene names or sensitivity for drug names). Then five PGx experts, including 3 co-authors and 2 PharmGKB curators, manually merged similar ones and organized them hierarchically in the entity hierarchy. Figure 4 shows how variant, polymorphism, and mutation are merged to define the entity Variant.
The entity hierarchy is defined with the subsumption relation (noted as ⊑ or subClassOf in OWL). Existential quantification is used to define sets of composite entities that are only modified by certain concepts. For example the set of entities that are modified by drugs is defined with the existential quantifier (Ǝ) and the role modified by: Ǝ modified.Drug (or modified someValuesFrom Drug in Manchester OWL syntax), see Figure 4 for examples. This definition is associated through a subsumption relation to entities that can be modified by drugs, such as DrugSensitivity. This pattern is used to distinguish what thing is specialized (or modified) by drugs from what is specialized by other modifiers (e.g. disease names). For example warfarin that we know to be a drug enables us to distinguish warfarin sensitivity from cancer sensitivity and to classify warfarin sensitivity as a kind of drug sensitivity versus disease sensitivity (represented by the DiseaseSensitivity concept).
Inverse roles are explicitly defined using the inverse constructor (-1 or inverseOf in OWL). As shown in the example in Figure 5, roles inhibits and isInhibitedBy are inverses of one another.
Class declarations are used to list all key entities of the domain of interest and what entity type they belong to. In our case, where gene-drug relationships are studied, known drugs and genes must be defined in the ontology as being an instance of the entity types Drug and Gene.
Building of WN-PHARE ontology using WordNet
In order to quantify the utility of manual review and editing of the raw relationships in building PHARE, we built a second ontology named WN-PHARE in a purely automated manner using the lexical resource WordNet . In this case all relationship types—and not just the 200 most frequent ones—are computationally merged in groups according to WordNet synsets. Resulting groups are directly used to define roles without any manual review. Similarly, all terms that modify gene, drug or phenotype names are merged in groups used to define composite entities.
Normalization and integration of heterogeneous relationships
The algorithm to normalize typed relationships between composite entities consists of four steps. The first three steps normalize the subject entity, the object entity, and the relationship type. The last step, assembles the three normalized pieces in a normalized relationship of the kind shown in Figure 1.
Normalization of composite entities (steps 1 and 2)
This step—described in Table 1—takes as input a raw composite (or atomic) entity and the PHARE ontology to return a normalized entity. The first word of the entity is recognized as the key entity. Then each following word that composes the entity is considered from left to right as something further specialized by previous words. The ontology is searched for an entity label that matches with the processed word (named read_word in the Table 1 algorithm). This algorithm is applied successively to the subject entity and the object entity of a relationship (Figure 6).
Normalization of relationship types (step 3)
The next step is to normalize the relationship type. The ontology is searched for role labels that match the raw relationship. When a match is found, the preferred name of the corresponding role is used to normalize the relationship type. Note that during this step the normalization process distinguishes between passive voice of the present tense, such as “A is inhibited by B” and active voice of simple past tense “B inhibited A”. Dependency Graphs of these two sentences are different because “inhibited” in the passive voice sentence is related through an aux dependency to “is” (standing for auxiliary). This difference is used during the relationship extraction to extract either is$$inhibited(A, B) or inhibited(A, B).
Assembly of normalized pieces (step 4)
The final step is to group together normalized composite entities and relationship type to produce normalized relationships. For each relationship, this step relies on the simple assembly of normalized type, subject and object. In addition if the role used to normalize the type has inverses or is symmetric then this step also creates the appropriate additional relationships. For each inverse role in the ontology, an inverse relationship is created with the preferred name of the inverse and where normalized subject and object are swapped. If the role is symmetric, one additional relationship is created with the same normalized relationship type but with subject and object swapped. Figure 5 illustrates the integration process that applies such relationship normalization on four heterogeneous sentences.
Applying the normalization on raw relationships produces a set of relationships represented as PHARE entities and roles. Consequently normalized relationships can be directly added to PHARE as instances to create a knowledge base.
Refinement of PHARE by repeating the normalization step
Raw relationships have been normalized twice using PHARE to iteratively refine the ontology. After the first iteration of the normalization, from the pool of un-normalized relationships we manually identify terms and roles that are either frequent or of PGx interest. Such terms (or roles) are then used to extend the set of synonyms of an entity already defined in the ontology, or used to create a new entity in the ontology.
Visualizing gene-disease networks
Figures 7 and 8 are made using a RDF to GML (Geography Markup Language) converter developed in-house. This converter enables the representation of RDF graphs in GML. GML files are then visualized and edited using Cytoscape 2.7 .
The PHARE ontology
The PHArmacogenomic RElationship ontology (or PHARE) contains 229 entity classes and 76 roles of interest in the PGx domain. PHARE is encoded in OWL-DL and is constructed semi automatically by (i) listing terms derived from relationships extracted automatically from text ; and (ii) the manual organization of the relationship terms by domain experts. Figures 2 and 3 illustrate how the extracted terms are organized in these hierarchies. The PHARE ontology is available online at http://purl.bioontology.org/ontology/PHARE.
The PHARE-Knowledge Base (PHARE-KB)
The ontology-driven integration process described in the method section takes as input a set of relationships extracted from MEDLINE abstracts and outputs a set of normalized relationships of the form Role(subject, object) represented using entity types and roles defined in PHARE. Therefore, normalized relationships can be used to instantiate roles defined in PHARE without additional processing. We performed such instantiation and obtained the PHARE-Knowledge Base (or PHARE-KB) that contains 28,676 roles instantiations encoded as RDF triples from over 41,000 raw relationships. If we consider instantiation of role inverses (e.g., isInhibitedBy (a,b) ≡ inhibits-1 (b,a)), the number of role instantiations rises to 46,526. Note that some roles in PHARE do not have inverse or are symmetric (e.g., isAssociatedWith).
Almost 77% role instantiations use roles initially encoded in PHARE and 23% necessitate the creation of new roles in PHARE. In other words PHARE roles are sufficiently detailed to capture 77% of the relationships we extracted from text analysis. New roles correspond to types of relationships that are not frequent enough in our corpus and consequently have not yet been manually reviewed and defined in PHARE. These roles, which are added solely to instantiate the 23% of un-normalized relationships are associated with only one, label and thus do not yet contribute to the integration of relationships.
The 28,676 role instances link roughly 16,000 individuals of the KB, including 285 genes, 1,083 drugs and 990 diseases. To facilitate overlap comparisons of PHARE-KB with other data sources individuals that are of type genes, drugs, or diseases are associated with their Entrez Gene, DrugBank, and MeSH identifiers respectively.
Individuals in the PHARE-KB can be classified using reasoning. Classification allows us to make the implicit knowledge units explicit. For example, classification infers that
i.e., VKORC1 expression is a phenotype
on the basis of the following two axioms
Expression ⊑ Phenotype
i.e., VKORC1 expression is a gene expression and gene expression is a phenotype.
Every relationship available in the PHARE-KB (in the form of a RDF triple) is associated with its provenance using the property rdfs:comment. For example, the triple isAssociatedWith(UCHL1, parkinson disease) is associated with the following string: ”[14522054, Neuronal ubiquitin C-terminal hydrolase (UCH-L1) has been linked to Parkinson's disease (PD), the progression of certain nonneuronal tumors, and neuropathic pain]”, Where 14522054 is the PMID (PubMed ID) of the article and the text is the sentence based on which the triple is created.
Evaluation and comparison
To evaluate the impact of the manual review and curation in the construction of the PHARE ontology, we constructed an alternate relationship ontology—named WN-PHARE—in a fully automated manner using WordNet as described in the methods section. Table 2 compares the structure and the effectiveness of PHARE and WN-PHARE in integrating heterogeneous text-mined relationships. These features are measured for the task of integrating a subset of relationships extracted for Parkinson's Disease (PD). This subset contains 2,827 PD relationships extracted from 2,124 distinct MEDLINE abstracts. Logic criteria (e.g., satisfiability) of the ontologies are not included in the comparison since both ontologies are consistent and coherent.
We find that the roles represented in PHARE cover the set of extracted relationships incompletely but they normalize more relationships than the roles in defined in WN-PHARE. Thus the manually reviewed ontology results in a better identification of similar relationships that are phrased differently in natural language, but it captures a smaller fraction of the total relationships extracted from text. Table 3 provides additional evaluation with numbers of similar relationships (same subject, predicate and object) identified first before normalization, second after normalization using PHARE, and third after normalization using WN-PHARE.
SPARQL query point
In order to publish the PHARE-KB for use on the Semantic Web, we set up a SPARQL endpoint, which is available at http://sparql.bioontology.org/webui/. Examples of queries are provided as additional file 1.
The KB is classified and inferred triples are materialized before loading into the triple store underlying the SPARQL endpoint. As a consequence queries return asserted as well as inferred facts.
An example of query for entities related to the uchl1 gene is shown below:
SELECT $y $z
WHERE <http://www.stanford.edu/~coulet/phare.owl#uchl1> $y $z;
This query returns the RDF triple isAssociatedWith(UCHL1, parkinson disease) mentioned previously. Queries can also return sets of RDF triples that are used to build sub-network related to a specific diseases as shown in Figure 7.
Disease related gene networks
Figures 7 and 8 show gene-disease sub-networks related to AD and PD respectively. For display purpose, these have been reduced by selecting only those nodes that are asserted to be related in more than 5 different sentences. Since the type of relationship differ in sentences, only the two most frequent relationships are displayed as labels on the edges. Each network was obtained using a SPARQL query to select triples where the disease (AD or PD) is either subject or object. Resulting set of triples is then filtered to keep the frequent relationships. Such filtering enables to us remove both false positives as well as irrelevant triples such as phare:alzheimer=disease rdf:type phare:Disease . Note that in RDF we use the symbol ‘=’ as a simple separator to replace spaces in coumpound nouns.
Our work is motivated by the need for automated approaches capturing and formalizing knowledge extracted from the literature and the need for publishing such knowledge on the Semantic Web. Recent advances in Natural Language Processing (NLP) techniques enable the extraction of fine-grained relationships mentioned in biomedical text . The variability and the complexity of natural language in expressing similar or simple relationships causes the extracted relationships to be highly heterogeneous. We show that the use of a relationship ontology can normalize and integrate the heterogeneous relationships extracted from text and serve as a common semantic framework to integrate text-mining derived facts into a knowledge base. However, the manual construction of a relationship ontology is a slow and expensive process . We have devised a method to construct such an ontology using the text-extracted heterogeneous relationships as a starting point. Although we only report on our experiments in the pharmacogenomics domain; we note that the approach described here can be applied for relationship extraction in other domains.
Linked data cloud and text-mined relationships
Our results in publishing RDF triples extracted from text align closely with the objectives of the Linking Open Data community project  and that of efforts such as the Concept Web Alliance . The goal of projects such as Linked Open Data is to publish various data sets as RDF on the Web and to declare links between data items from different data sources.
Currently, the relationships we extract do not integrate easily with content in the Link Data Cloud for two main reasons: the lack of resource unique identifiers and the lack of an agreed upon relation ontology. Despite community efforts to create unique resource identifiers for life sciences, currently there is no clear consensus [21, 22]. In addition, composite entities, such as VKORC1 expression that participate in relationships are too complex to reference using a single identifier. Moreover, the absence of an expressive and comprehensive relation ontology led us to develop our own in a boot-strapped manner from example instances of text-mined relationships. PHARE is designed for the purpose of representing PGx relationships and we anticipate that sharing it with the community will provide a much needed example set for the development of a proper, formal biomedical relation ontology. PHARE is particularly suited to seed that activity, because it is built from the most frequent relationships that are used in the scientific literature. One challenge is thus to propose consistent mappings between relationship types arising from the literature, such as those suggested by PHARE and relationship types arising from functional annotations such as “suppresses gene” or “enhances gene” suggested by TAIR relations or the Gene Ontology .
Limitations of our approach
Adequately representing provenance information at the sentence level is a challenge. Currently, we utilize the rdfs:comment property to store provenance for each extracted fact in PHARE-KB. In the future, we plan to evaluate the Annotation Ontology developed by Ciccarese et al.  for its utility is representing provenance at the sentence level, particularly in workflows where both automated and manual approaches are used simultaneously.
Another limitation is the incoherence between gene name identifiers across data sources. Our gene identifiers are based on PharmGKB gene names that are not entirely consistent with the HUGO Gene nomenclature , making cross referencing with other sources time consuming. In a similar vein, recall for extracted relations may improve upon using advanced Named Entity Recognition such as disambiguation techniques rather than the current PharmGKB-derived dictionary based approach.
The efficacy of the relationship normalization and integration might vary depending on the source of the text such as full articles, clinical reports, clinical files or drug labels. However, because PHARE has been designed using MEDLINE abstracts, it may capture relationships mentioned in diverse sources.
We have described the construction of an ontology of relationships in the PGx domain and its use to integrate heterogeneous relationships extracted by text-mining. The synonyms, entity descriptions, and the hierarchies of entities and roles represented in the ontology are used to map text-derived relationships to the ontology. Once mapped, relationships can be normalized and compared using the semantics defined in the ontology to identify relationships that have similar semantics but different syntax. We compare and contrast a fully automated and a manually edited version of the PHARE ontology to quantify the degree of integration enabled by manual inspection, curation and refinement of the PHARE ontology. PHARE has been successfully used in a pipeline for the integration of pharmacogenomic relationships extracted from MEDLINE abstracts . The result of the integration is compiled into a knowledge base named PHARE-KB, which can now be queried using Semantic Web technologies such as SPARQL and can be visualized in the form of a biological network. PHARE-KB can also be queried programmatically, for example, to guide computational prediction of molecular interactions .
Named Entity Recognition
Natural language Processing
Web Ontology Language
Web Ontology Language, Description Logic Kind
Resource Description Framework
SPARQL Protocol And RDF Query Language.
Groth P, Gibson A, Velterop J: The anatomy of a nanopublication. Information Services and Use. 2010, 30 (1-2): 51-56.
Klein T, Chang J, Cho M, Easton K, Fergerson K, Hewett M, Lin Z, Liu Y, Liu S, Oliver D, Rubin D, Shafa F, Stuart J, Altman RB: Integrating genotype and phenotype information: An overview of the PharmGKB project. The Pharmacogenomics Journal. 2001, 1 (3): 167-170. 10.1038/sj.tpj.6500035.
Garten Y, Coulet A, Altman R: Recent progress in automatically extracting information from the pharmacogenomic literature. Pharmacogenomics. 2010, 11 (10): 1467-1489. 10.2217/pgs.10.136.
Hunter L, Lu Z, Firby J, Baumgartner WA, Johnson HL, Ogren P, Cohen K: OpenDMAP: An open-source, ontology-driven concept analysis engine, with applications to capturing knowledge regarding protein transport, protein interactions and cell-type-specific gene expression. BMC Bioinformatics. 2008, 9: 78-10.1186/1471-2105-9-78.
Friedman C, Kra P, Yu H, Krauthammer M, Rzhetsky A: Genies: a natural-language processing system for the extraction of molecular pathways from journal articles. Bioinformatics. 2001, 17 (suppl 1): S74-S82. 10.1093/bioinformatics/17.suppl_1.S74.
Saric J, Jensen LJ, Ouzounova R, Rojas I, Bork P: Extraction of regulatory gene/protein networks from medline. Bioinformatics. 2006, 22 (6): 645-650. 10.1093/bioinformatics/bti597.
Ciaramita M, Gangemi A, Ratsch E, Saric J, Rojas I: Unsupervised learning of semantic relations between concepts of a molecular biology ontology. IJCAI. 2005, 659-664.
Ramakrishnan C, Mendes P, Wang S, Sheth A: Unsupervised Discovery of Compound Entities for Relationship Extraction. EKAW. 2008, 146-155.
Tari L, Answar S, Liang S, Cai J, Baral C: Discovering drug interactions: a text-mining and reasoning approach based on properties of drug metabolism. Bioinformatics. 2010, 26 (18): i547-i553. 10.1093/bioinformatics/btq382.
Manning CD, Schütze H: Foundations of Statistical Natural Language Processing. 1999, Cambridge, MS, The MIT Press
Coulet A, Shah NH, Garten Y, Musen MA, Altman RB: Using Text to Build Semantic Networks for Pharmacogenomics. Journal of Biomedical Informatics. 2010, 43 (6): 1009-19. 10.1016/j.jbi.2010.08.005.
Agichtein E, Gravano L: Snowball: extracting relations from large plain text collections. ACM DL. 2000, 85-94.
Xu R, Supekar K, Morgan A, Das A, Garber A: Unsupervised method for automatic construction of a disease dictionary from a large free text collection. AMIA. 2008, 820-824.
PharmGKB VIP genes. [http://www.pharmgkb.org/search/annotatedGene]
de Marneffe MC, Manning CD: The Stanford typed dependencies representation. COLING Workshop on Cross-framework and Cross-domain Parser Evaluation. 2008
Feebaum C: WordNet, An Electronic Lexical Database. 1998, Cambridge, MS, The MIT Press
Cytoscape website. [http://www.cytoscape.org/]
Smith B, Ceusters W, Klagges B, Köhler J, Kumar A, Lomax J, Mungall C, Neuhaus F, Rector AL, Rosse C: Relations in biomedical ontologies. Genome Biology. 2005, 6: R46-10.1186/gb-2005-6-5-r46.
Linking Open Data Community Project. [http://esw.w3.org/SweoIG/TaskForces/CommunityProjects/LinkingOpenData]
Mission of the Concept Web Alliance. [http://conceptweblog.wordpress.com/declaration/]
Life Science Identifier resolution project. [http://lsids.sourceforge.net/]
Shared Name project. [http://sharedname.org/]
Relation Ontology and TAIR Relations. [http://www.bioontology.org/wiki/index.php/RO:Main_Page#TAIR_Relations]
Ciccarese P, Ocana M, Castro LJG, Das S, Clark T: An Open Annotation Ontology for Science on the Web. J Biomed Semantics. 2011, 2 (Suppl 2): S4-10.1186/2041-1480-2-S2-S4.
HUGO Gene Nomenclature. [http://www.genenames.org/]
Garten Y: Text mining the scientific literature to identify pharmacogenomic interactions. PhD Thesis in Biomedical Informatics. 2010, Stanford University
This work was supported in part by the National Center for Biomedical Ontologies, under roadmap-initiative grant (U54HG004028) from the NIH and by the PharmGKB (GM61374), with computing cluster support from the NSF (CNS-0619926).
This article has been published as part of Journal of Biomedical Semantics Volume 2 Supplement 2, 2011: Proceedings of the Bio-Ontologies Special Interest Group Meeting 2010. The full contents of the supplement are available online at http://www.jbiomedsem.com/supplements/2/S2.
Authors declare no competing interests.
AC designed and implemented the ontology driven relationship normalization as well as wrote the manuscript. YG improved the approach and the ontology. MD contributed to the evaluation and discussion sections. YG and MD critically reviewed the manuscript. RBA and MAM obtained funds and gave scientific directions. NHS supervised the project, participated in technical discussions and wrote the manuscript.
Electronic supplementary material
Additional file 1:Examples of SPARQL queries Description of data: This file proposes examples of SPARQL queries that can be used to query PHARE-KB on the SPARQL endpoint set up at http://sparql.bioontology.org/webui/(TXT 4 KB)
Rights and permissions
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://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
Coulet, A., Garten, Y., Dumontier, M. et al. Integration and publication of heterogeneous text-mined relationships on the Semantic Web. J Biomed Semant 2 (Suppl 2), S10 (2011). https://doi.org/10.1186/2041-1480-2-S2-S10
- Dependency Graph
- Relationship Type
- Link Open Data
- MEDLINE Abstract