<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Semantic Knowledge Graph Network Features for Drug Repurposing</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tareq B. Malas</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roman Kudrin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sergei Starikov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Peter A.C. ́ʼt Hoen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dorien J.M. Peters</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Roos</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kristina M. Hettne</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Human Genetics, Leiden University Medical Center</institution>
          ,
          <addr-line>2300 RC Leiden</addr-line>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Faculty of Bioengineering and Bioinformatics, Moscow State University</institution>
          ,
          <addr-line>119234 Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Given the significant time and financial costs of developing a commercial drug, it remains important to constantly reform the drug discovery pipeline with novel technologies that can narrow the candidates down to the most promising lead compounds for clinical testing. Computational approaches are used to expedite the drug discovery processes. Semantic knowledge graphs can assist these computational approaches, because they connect different biological databases and reflect the relationships between genes, pathways and diseases. Here, we took advantage of the Euretos Knowledge Platform (EKP), a commercial database that integrates more than 170 different biological resources including DrugBank, and evaluated the usefulness of the underlying semantic knowledge graphs to predict novel drug-disease associations. We extracted network-based features from the semantic knowledge graph and tested their ability to separate between the positive and negative data sets of drug-disease pairs. Our results showed that the extracted features such as the total number of intermediate concepts (count), the number of different semantic categories (diversity), and the predicates connecting a drug-disease pair were successful in separating the positive from the negative sets. These features provide a proof of concept for using semantic knowledge graphs for drug repurposing efforts. Our work reveals the added value of integrating different biological databases for solving complex biological questions.</p>
      </abstract>
      <kwd-group>
        <kwd>Drug repurposing</kwd>
        <kwd>drug discovery</kwd>
        <kwd>Semantic graphs</kwd>
        <kwd>network mining</kwd>
        <kwd>machine learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In silico methodologies are becoming more important in the modern-day drug
discovery pipeline. Computational drug discovery techniques accelerated the identification of
drug targets and significantly contributed to the different stages of drug development
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Most efforts are concentrated into developing methods for the prediction of
drugtarget interactions that mitigate the expensive costs of experimental drug development
and optimization [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Moreover, these methods are allowing for drug repurposing
efforts that identify new therapeutic applications for existing drugs and reduce research
cost and time due to the existing extensive clinical studies [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ].
      </p>
      <p>
        Given that the majority of diseases cannot be explained by single-gene defects but
by the coordinated functions of their complex gene networks, drug development needs
to shift its attention towards understanding network-based perspectives of disease
mechanisms. Network-based approaches are providing important insights into the
relationship between drugs and diseases. An investigation into the interaction between drug
targets and disease genes revealed that they are not closely related [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Additionally,
network-based approaches are showing promise in predicting novel targets and new
uses for existing drugs [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Current network-based approaches rely on drug target
profile similarities. These similarities are defined by either the number of targets two drugs
share or the shortest paths between their interactomes. However, these studies focus
only on using a limited number of databases related to protein drug targets, leaving a
large amount of rich data untapped.
      </p>
      <p>Semantic and text-mining approaches that screen hundreds of thousands of
published literature articles have demonstrated the possibility of extracting concepts of
biological meaning of various types. Semantic knowledge graphs are constructed to
connect concepts of various ty</p>
      <p>
        pes based utilizing a number of resources such as literature knowledge and biological
databases. Such knowledge graphs can then be used to infer novel connections based
on network mining methods [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ]. In addition to semantic connections, large efforts
were made to integrate biological databases across gene, protein, pathway, disease and
drug domains. The Euretos Knowledge Platform (EKP, http://www.euretos.com/) is a
commercial database that integrates more than 170 different biological resources
including semantic data [http://www.euretos.com/files/EKPSources2017.pdf]. These
data sources are used by EKP to build a large network of connected biological concepts.
Disease and drug concepts in EKP are directly or indirectly connected based on prior
knowledge found in publications and/or other databases. We expect that leveraging a
large set of databases will enhance our drug discovery ability and avoid relying on a
single source of information to associate drugs to diseases. Each semantic type provides
us with an additional layer of information that can be exploited to identify novel drug
disease associations.
      </p>
      <p>In this work, we have taken advantage of the EKP to evaluate the usefulness of the
underlying semantic knowledge graphs to predict novel drug-disease associations. With
the current exponential growth in biological data, semantic knowledge graphs have a
great potential for drug discovery.</p>
    </sec>
    <sec id="sec-2">
      <title>Materials and Methods</title>
      <sec id="sec-2-1">
        <title>Data Acquisition and Mapping in EKP</title>
        <p>
          Drug disease pairs were acquired from Guney et al [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. We specifically acquired the
drug disease associations based on their analysis. We had 403 pairs of 239 drugs and
78 diseases that formed our positive “gold-standard” (GD) data. By randomly shuffling
the 403 drug disease pairs of the positive dataset, we created 20 unique negative
datasets that included 403 random drug disease pairs not seen in the positive dataset. We
averaged the results of the negative datasets in the downstream analysis.
        </p>
        <p>In EKP we first mapped the DrugBank IDs of the drugs in our datasets to drug
concepts in EKP. We used full disease names to map the diseases in our dataset to disease
concepts in EKP. Triples of drug disease pairs were identified in EKP if they were
directly connected by at least one of the resources used in EKP (Figure-1). Predicates
of drug disease triples were classified as “relevant” if they belonged to one of the
following categories: “treats”, “affects”, “prevents”, “disrupts”. The LUMC has a local
installation of this knowledge graph for research purposes.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Network Features</title>
        <p>Network features were calculated for the intermediate concepts connecting drug disease
pair. To evaluate if we could use the indirect associations to predict novel associations
between drugs and diseases, we used the positive and negative datasets as follows. For
each indirect association, we calculated a number of features and tested if these features
could separate the two datasets. These features were calculated for each semantic
subcategory (SubSemantic) available in EKP.</p>
        <p>I. Count_normalized referred to as count in the following text:
(“SubSemantic_typeY”) = X ÷ (y × z)
(1)
X = total number of SubSemantic_typeY connecting the drug (y number of unique drugs
making one drug concept) with disease (z number of unique diseases making one
disease concept). The number of intermediate concepts between the drug and disease
concepts was normalized by the multiplication of y and z.</p>
        <p>II. Diversity = The total number of unique SubSemantic categories connecting the
drug and disease concepts per semantic type.</p>
        <p>III. Predicates from the drug concept to the intermediate concept and from the
intermediate concept to the disease concept were combined and referred to as “predicate
path”. We used the Chi-square test to identify, within each semantic subcategory, the
most enriched paths in the GD vs the negative dataset (cutoff p-value &lt; 0.05). We
filtered out paths that made up less than 1% of the total amount of paths within each
semantic subcategory.</p>
        <p>For I and II we used the Kolmogorov–Smirnov to test the similarity of the
distribution of scores between the positive and the negative datasets (cutoff p-value &lt; 0.05)</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Results and Discussion</title>
      <sec id="sec-3-1">
        <title>Concept Mapping and Direct Associations</title>
        <p>
          We acquired the dataset of curated drug disease relationships (drugs used in the
treatment of certain diseases) from Guney et al [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. The GD dataset included 239 drugs, 78
diseases and 403 drug-disease pairs. For the negative dataset, we reshuffled the GD into
20 random datasets. The results of the negative datasets were averaged and compared
to the GD.
        </p>
        <p>We used DrugBank IDs available in the GD dataset to map drugs from the GD and
negative datasets into EKP concepts and we used the full disease name to map diseases,
since no unique identifier was supplied in the GD dataset. Out of 239 drugs, 235 were
mapped successfully. All diseases were mapped successfully into EKP. Whendisease
or drug term mapped to more than one concept in the EKP, this was corrected for
(Figure-1).</p>
        <p>Using the EKP we retrieved the triples for drug-disease pairs found in the GD and
negative datasets. Each semantic triple consists of a subject-predicate-object, where the
subject and the object refer to the drug and the disease respectively, and the predicate
refers to the relationship connecting them. From the pairs found in the GD, 83%
mapped to a triple in the EKP, whereas in the negative datasets 22% of the pairs mapped
to a triple in the EKP. Moreover, from the mapped triples in the GD, 90% had a
predicate type that we consider positive for a drug-disease association i.e. ‘treats’, compared
to 75% in the negative datasets. These results demonstrate that the drug disease pairs
in the GD and the negative datasets are different in two main aspects. 1). Most of the
GD drug disease pairs could be represented in direct triples owing to prior knowledge
of the pair’s relationship. 2). The type of the predicates is different when comparing the
triples of the GD and negative datasets, where the GD contains a higher proportion of
the “relevant” predicates. The observed 22% of random drug disease pairs that mapped
to triples in EKP could be explained by the smaller proportion of “relevant” predicates
compared to GD. These triples would contain negative drug disease indications or a
drug that treats a side symptom of the disease.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Evaluating the Indirect Drug-Disease Associations</title>
        <p>
          As we are interested in drug repurposing, we were looking for novel associations
between drugs and diseases. We utilized the indirect drug disease associations as a basis
for our method, where we aim to mine the full EKP graph of indirect drug disease
associations for strong candidates using network based features. To identify which
features are useful, we used the GD and the negative datasets and evaluated several
network features on the indirect associations retrieved from them. In the EKP, 14 semantic
types are defined based on the semantic groups as defined by the Unified Medical
Language System [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], with a number of semantic subcategories under each semantic type.
Our analysis of indirect associations, i.e. drugs and diseases that connected via a third
concept, was done per subsemantic category.
        </p>
        <p>All 403 drug-disease associations in the GD and negative dataset were connected by
at least one intermediate concept from the semantic types available in EKP. Out of the
14 possible semantic categories, 12 were found to connect a drug and a disease. We
next evaluated which semantic and semantic subcategories were the most informative.
Using the count diversity feature, defined as the total number of a certain intermediate
concept connecting a drug disease pair, the semantic type ‘Chemicals &amp; Drugs’ was the
most informative intermediate semantic type and distinguished the positive and
negative sets best (Kolmogorov-Smirnov p-value: 7.4. 10-23). Density plots of the count
values per semantic and semantic subcategory in both the GD and the negative data reveal
visually that the GD contained a higher number of indirect concepts in most semantic
categories compared to the negative dataset, such as “Chemicals &amp; Drugs”, “Anatomy”,
“Disorders” and “Procedures” semantic categories (Figure-2A, Table-1).</p>
        <p>Another feature we investigated was the diversity of the different semantic types
connecting a drug disease pair. In this analysis we compared the total number of unique
semantic categories and semantic subcategories in the drug disease pairs of the GD and
negative datasets. As observed for the count feature, the GD drug disease pairs
displayed a higher semantic diversity in their intermediate concepts (Figure-2B).</p>
        <p>We also investigated the predicate types that connect the indirect concept with the
drug disease pairs. In this analysis we used two predicates, the one connecting the drug
with the intermediate concept and the one connecting the intermediate concept with the
disease concept. The combination of these two predicates in this order is referred to as
the predicate path. Using the chi-squares test we investigated if there were predicate
paths that are enriched in the GD and negative datasets. We found the most enriched
paths in the “Amino Acid, Peptide or Protein” and “Pharmacologic Substance”
semantic subcategories (Figure-2C). For example, the path “drug is compared with 
Pharmacologic Substance  treats Disease” that belongs to the “Pharmacologic
Substance” semantic subcategory is strongly enriched in the GD that can be interpreted as
drugs that are known to be similar in function or chemical properties can be repurposed
for the same disease.</p>
        <p>These results indicate that the type of, count and the predicates relating to the
intermediate concepts connecting a drug and a disease pair were informative in
differentiating positive and negative datasets. The added values of using a diverse set of semantic
categories was demonstrated. In the count feature, we found almost all semantic
categories shifted towards higher values in the GD when compared to the negative data.
Additionally, the diversity feature revealed that the GD tends to have a higher number
of semantic categories and subcategories as intermediate concepts connecting drugs
and diseases. Having the ‘Chemicals &amp; Drugs’ as the most differentiating semantic
category also demonstrates the importance of looking at drug properties and not
completely relying on the drug targets.</p>
        <p>
          In contrast to other tools, our methodology is different in a number of ways. The
quantity and diversity of databases that we included is larger and the content much
richer than other comparable tools. In terms of quantity we have taken advantage of
EKP that integrates more than 170 resources. Other network-based tools such as SLAP
[
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and ProphNet [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] include 17 and 3 databases respectively. In terms of diversity,
EKP includes databases that span drug, disease, phenotype, protein, gene and molecular
pathways. Additionally, EKP takes advantage of mining the PubMed published
literature. To our knowledge this is the most resource inclusive effort in network-based drug
disease associations. Our methodology utilizes drug disease connections beyond the
commonly used drug-targets-disease framework to expand the possibilities to include
other semantic categories, such as drug-drug and disease-disease similarities,
phenotypes, pathways, proteins and biological function annotations. Our method utilizes
semantic knowledge graphs properties and can be extended to other semantic knowledge
graphs that contain drug and disease concepts.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>Computational efforts in drug discovery are gaining popularity for their ability to
reduce the costs involved in drug development. Network-based approaches are currently
being used for drug repurposing efforts. We have taken advantage of the EKP that
integrates more than 170 biological sources. Leveraging 12 semantic categories that are
found in the EKP to connect drug and disease pairs, we identified three main network
features that showed significant differences in the characteristics of the intermediate
concepts connecting the drug disease pairs in the Gold Standard and negative datasets.
These features can be readily used to build a classifier that will mine the full EKP graph
to propose novel drug disease associations. Additional network features that are tailored
to specific semantic types can be further extracted to fine tune the performance of the
classifier.</p>
      <p>This work demonstrates that semantic knowledge graphs have a strong potential in
mitigating drug discovery efforts. We expect semantic graphs to grow with the
exponential growth in data generation in life sciences. Thus, rendering semantic knowledge
graphs even more valuable for drug discovery.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>The research leading to these results has received funding from the People Program (Marie
Curie Actions) of the European Union’s Seventh Framework Program FP7/2077-2013 under REA
grant agreement no. 317246. In addition, the European Commission (FP-7 project RD-Connect,
grant agreement No. 305444).
6</p>
    </sec>
    <sec id="sec-6">
      <title>Competing Interests</title>
      <p>Kristina M. Hettne has performed paid consultancy since November 1, 2015, for
Euretos b.v, a startup founded in 2012 that develops knowledge management and discovery
services for the life sciences, with the Euretos Knowledge Platform as a marketed
product
7</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Choi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Macalino</surname>
            ,
            <given-names>S.J.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cui</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basith</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Expediting the Design, Discovery, and Development of Anticancer Drugs using Computational Approaches</article-title>
          .
          <source>Curr. Med. Chem</source>
          . (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Glick</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jacoby</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>The role of computational methods in the identification of bioactive compounds</article-title>
          .
          <source>Curr. Opin. Chem. Biol</source>
          .
          <volume>15</volume>
          ,
          <fpage>540</fpage>
          -
          <lpage>546</lpage>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Perlman</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gottlieb</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Atias</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruppin</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sharan</surname>
          </string-name>
          , R.:
          <article-title>Combining drug and gene similarity measures for drug-target elucidation</article-title>
          .
          <source>J. Comput. Biol</source>
          .
          <volume>18</volume>
          ,
          <fpage>133</fpage>
          -
          <lpage>145</lpage>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Yildirim</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goh</surname>
            ,
            <given-names>K.-I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cusick</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barabási</surname>
            ,
            <given-names>A.-L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vidal</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Drug-target network</article-title>
          .
          <source>Nat. Biotechnol</source>
          .
          <volume>25</volume>
          ,
          <fpage>1119</fpage>
          -
          <lpage>1126</lpage>
          (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Network-based drug repositioning</article-title>
          .
          <source>Mol. Biosyst</source>
          .
          <volume>9</volume>
          ,
          <fpage>1268</fpage>
          -
          <lpage>1281</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wild</surname>
            ,
            <given-names>D.J.</given-names>
          </string-name>
          :
          <article-title>Assessing drug target association using semantic linked data</article-title>
          .
          <source>PLoS Comput. Biol</source>
          .
          <volume>8</volume>
          ,
          <issue>e1002574</issue>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hettne</surname>
            ,
            <given-names>K.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thompson</surname>
          </string-name>
          , M., van Haagen,
          <string-name>
            <surname>H.H.H.B.M.</surname>
          </string-name>
          ,
          <string-name>
            <surname>van der Horst</surname>
          </string-name>
          , E.,
          <string-name>
            <surname>Kaliyaperumal</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mina</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tatum</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Laros</surname>
            ,
            <given-names>J.F.J.</given-names>
          </string-name>
          , van
          <string-name>
            <surname>Mulligen</surname>
            ,
            <given-names>E.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schuemie</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aten</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>T.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bruskiewich</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Good</surname>
            ,
            <given-names>B.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Su</surname>
            ,
            <given-names>A.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kors</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          , den Dunnen, J., van Ommen,
          <string-name>
            <given-names>G.-J.B.</given-names>
            ,
            <surname>Roos</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          , 't Hoen,
          <string-name>
            <given-names>P.A.C.</given-names>
            ,
            <surname>Mons</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Schultes</surname>
          </string-name>
          ,
          <string-name>
            <surname>E.A.</surname>
          </string-name>
          :
          <article-title>The Implicitome: A Resource for Rationalizing Gene-Disease Associations</article-title>
          .
          <source>PLoS One</source>
          .
          <volume>11</volume>
          ,
          <issue>e0149621</issue>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Guney</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Menche</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vidal</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barábasi</surname>
          </string-name>
          , A.-L.:
          <article-title>Network-based in silico drug efficacy screening</article-title>
          .
          <source>Nat. Commun</source>
          .
          <volume>7</volume>
          ,
          <issue>10331</issue>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>McCray</surname>
            ,
            <given-names>A.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burgun</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bodenreider</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Aggregating UMLS semantic types for reducing conceptual complexity</article-title>
          .
          <source>Stud. Health Technol. Inform</source>
          .
          <volume>84</volume>
          ,
          <fpage>216</fpage>
          -
          <lpage>220</lpage>
          (
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Martínez</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cano</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blanco</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>ProphNet: a generic prioritization method through propagation of information</article-title>
          .
          <source>BMC Bioinformatics</source>
          .
          <volume>15</volume>
          <issue>Suppl 1</issue>
          ,
          <issue>S5</issue>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>