<!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>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Samira Oulefki</string-name>
          <email>soulefki@usthb.dz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lamia Berkani</string-name>
          <email>lberkani@usthb.dz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ladjel Bellatreche</string-name>
          <email>bellatreche@ensma.fr</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>LIAS/ISAE-ENSMA</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Poitiers</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>France</string-name>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>FAISS-based Approximate Nearest Neighbor</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dep. of Artificial Intelligence and Data Sciences, Faculty of Informatics, USTHB</institution>
          ,
          <addr-line>Bab Ezzouar 16111, Algiers</addr-line>
          ,
          <country country="DZ">Algeria</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>BioGITOM is an advanced ontology matching (OM) system tailored for the biomedical domain, aiming to achieve precise ontology alignment and foster semantic interoperability. It integrates Sentence-SapBERT for generating domain-specific semantic embeddings from biomedical concept definitions, capturing fine-grained lexical and contextual nuances. These embeddings are further refined through a hybrid structural encoder that combines Graph Isomorphism Networks and Graph Transformers to jointly model local and global dependencies within ontology graphs. To eficiently handle large-scale biomedical ontologies, BioGITOM employs a FAISS-based Approximate Nearest Neighbor (ANN) retrieval strategy for fast and scalable candidate selection. This synergistic design enables the system to robustly manage the complexity and heterogeneity of biomedical data. In the OAEI 2025 Bio-ML benchmark, BioGITOM ranked first in two tasks (NCIT-DOID and OMIM-ORDO) and second in three tasks (SNOMED-NCIT (Pharm), SNOMED-NCIT (Neoplas), and SNOMED-FMA (Body)), achieving the best overall performance with an average F1-score of 0.804, outperforming ten competing systems.</p>
      </abstract>
      <kwd-group>
        <kwd>Ontology matching</kwd>
        <kwd>deep learning</kwd>
        <kwd>Graph Neural Network</kwd>
        <kwd>graph transformer</kwd>
        <kwd>graph isomorphism transformer</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
Workshop</p>
      <p>ISSN1613-0073</p>
      <p>BioGITOM to capture both local structural regularities and long-range semantic dependencies within
ontology graphs.</p>
      <p>
        To eficiently scale to millions of biomedical entities, BioGITOM employs a FAISS-based L2
Approximate Nearest Neighbor (ANN) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] retrieval strategy, enabling rapid and accurate candidate selection
during the matching process. This integration of domain-aware semantic encoding, graph-based
structural reasoning, and eficient large-scale retrieval allows BioGITOM to achieve state-of-the-art accuracy
and robustness.
      </p>
    </sec>
    <sec id="sec-2">
      <title>1.1. State, Purpose, General Statement</title>
      <p>BioGITOM is a specialized OM system developed to ensure semantic interoperability across
heterogeneous biomedical knowledge sources. Its main goal is to enable consistent integration and alignment
of diverse ontological frameworks, supporting large-scale data sharing and reasoning in biomedical
research. By leveraging domain-aware semantic encoding and structural learning, BioGITOM provides
an efective solution to the challenges posed by the diversity of biomedical terminologies and ontology
structures.</p>
    </sec>
    <sec id="sec-3">
      <title>1.2. Specific Techniques Used</title>
      <p>
        BioGITOM leverages an advanced combination of neural and graph-based techniques to achieve
highprecision matching by jointly exploiting the semantic and structural dimensions of biomedical concepts.
The principal components are summarized below [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]:
1. Preprocessing: This module prepares raw ontology data for downstream processing. It parses
OWL (Ontology Web Language) files, constructs RDF (Resource Description Framework) graphs,
and extracts labels, definitions, and synonyms of ontology concepts. This stage produces a
comprehensive lexical and relational representation of each ontology, forming the basis for
subsequent encoding.
2. Semantic Encoder (Sentence-SapBERT): BioGITOM employs Sentence-SapBERT, a sentence-level
biomedical encoder fine-tuned on UMLS concept definitions, to generate domain-aware semantic
embeddings. These embeddings capture fine-grained lexical and contextual nuances in biomedical
terminology, providing robust semantic representations of ontology entities.
3. Graph Isomorphism Transformer (GIT): At the core of BioGITOM lies the GIT model, which
integrates GINs and GTs to encode both local and global structural dependencies within ontology
graphs:
• GINs model neighborhood connectivity patterns to preserve discriminative local structures.
• GTs use multi-head attention to capture long-range relationships among distant nodes.
This hybrid design produces expressive structural embeddings that represent both hierarchical
and cross-graph dependencies among biomedical concepts.
4. Gated Combination Module: This module fuses the semantic embeddings from Sentence-SapBERT
with the structural embeddings generated by the GIT model. Through a learnable gating
mechanism [10], BioGITOM dynamically adjusts the relative contribution of semantic and structural
signals, producing optimized embeddings that balance meaning and topology for each ontology.
5. FAISS-Based L2 Retrieval and Mapping Selection: To eficiently match large-scale biomedical
ontologies, BioGITOM integrates a FAISS-based Approximate Nearest Neighbor (ANN) retrieval
mechanism using the L2 distance metric. This approach enables fast and scalable similarity search
in the joint embedding space, identifying the top-k candidate correspondences for each source
concept. The retrieved pairs are then ranked by similarity scores to produce the final set of
mappings with associated confidence values.
      </p>
    </sec>
    <sec id="sec-4">
      <title>1.3. Adaptations made for the evaluation</title>
      <p>For this evaluation, BioGITOM was deployed in its standard configuration, without any task-specific
adaptations or parameter tuning. This setup highlights the system’s intrinsic versatility and robustness,
as it achieved consistently high performance across benchmarks without additional customization.</p>
    </sec>
    <sec id="sec-5">
      <title>1.4. Link to the system and parameters file</title>
      <p>BioGITOM is a fully developed OM system, now publicly available for research and benchmarking
purposes. The complete source code, pretrained models, and documentation can be accessed through
the oficial GitHub repository: https://github.com/lias-laboratory/biogitom.</p>
      <sec id="sec-5-1">
        <title>2. Results</title>
        <p>The evaluation of BioGITOM on the OAEI 2025 Bio-ML track covers five benchmark datasets. The
following subsections summarize its performance and comparative analysis.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>2.1. Performance evaluation of BioGITOM using OMIM-ORDO dataset</title>
      <p>As reported in Table 1, BioGITOM delivers the best overall results on the OMIM–ORDO dataset. It
achieves a precision of 0.845 and a recall of 0.736, leading to an F1-score of 0.787. These figures
demonstrate the model’s capacity to generate accurate correspondences while maintaining a high
coverage of relevant matches.</p>
      <p>Although the OMIM–ORDO dataset has limited structural depth (maximum concept depth = 2),
BioGITOM efectively leverages rich semantic representations to overcome this constraint and deliver
highly reliable alignments.</p>
    </sec>
    <sec id="sec-7">
      <title>2.2. Performance evaluation of BioGITOM using DOID-NCIT dataset</title>
      <p>On the NCIT–DOID dataset (Table 2), BioGITOM achieves the highest overall performance, ranking
ifrst among all participating systems. It attains an F1-score of 0.918, with a precision of 0.924 and a
recall of 0.911, reflecting a balanced trade-of between accuracy and completeness. While LogMapLt
reaches the highest precision (0.976) and LogMapBio the highest recall (0.959), BioGITOM stands out
for its stability across metrics and its ability to align structurally and semantically diverse ontologies
with remarkable consistency.</p>
    </sec>
    <sec id="sec-8">
      <title>2.3. Performance evaluation of BioGITOM using SNOMED-FMA (Body) dataset</title>
      <p>Performance on the SNOMED–FMA dataset (Table 3) highlights BioGITOM’s strong recall capacity.
Although BERTMap and BERTMapLt lead in precision (0.970), BioGITOM achieves a precision of 0.829
combined with the highest recall (0.748) among all systems. This combination produces an F1-score of
0.787, confirming the model’s eficiency in capturing a large proportion of valid correspondences across
structurally extensive biomedical ontologies.</p>
    </sec>
    <sec id="sec-9">
      <title>2.4. Performance evaluation of BioGITOM using SNOMED-NCIT (Pharm) dataset</title>
      <p>For the SNOMED–NCIT (Pharm) task (Table 4), BioGITOM displays a consistent balance between
precision and recall. While LogMapLt reaches the highest precision (0.994), BioGITOM secures the
best recall (0.779) and an F1-score of 0.786. These outcomes emphasize the model’s adaptability
in identifying a broad spectrum of correct mappings and its reliability in managing heterogeneous
biomedical ontologies.</p>
    </sec>
    <sec id="sec-10">
      <title>2.5. Performance evaluation of BioGITOM using SNOMED-NCIT (Neoplas) dataset</title>
      <p>As displayed in Table 5, BioGITOM achieves competitive results on the SNOMED–NCIT (Neoplas)
dataset. With a recall of 0.719, it ranks among the strongest systems in terms of coverage, despite
LogMapLt attaining the highest precision (0.931). The resulting F1-score of 0.745 illustrates BioGITOM’s
resilience in dealing with semantically intricate and hierarchically layered ontologies, reafirming its
reliability across diferent biomedical alignment scenarios.</p>
      <sec id="sec-10-1">
        <title>3. General Comments</title>
      </sec>
    </sec>
    <sec id="sec-11">
      <title>3.1. Comments on the Results (Strengths and Weaknesses)</title>
      <p>The experimental results clearly highlight the competitive advantage and robustness of BioGITOM
compared to other top-performing systems in the OAEI 2025 Bio-ML track. One of the principal
strengths of the proposed approach lies in the Graph Isomorphism Transformer (GIT) architecture,
which efectively integrates local neighborhood modeling through Graph Isomorphism Networks (GINs)
with global dependency capture via Graph Transformers (GTs). This hybrid design enables the model
to generate contextually enriched and structurally coherent representations, allowing BioGITOM to
handle the inherent complexity, heterogeneity, and hierarchical diversity of biomedical ontologies.</p>
      <p>Another major strength is the Sentence-SapBERT encoder, which leverages domain-specific language
modeling on biomedical concept definitions to capture subtle lexical and semantic nuances. The synergy
between semantic encoding and graph-based structural reasoning proved crucial for achieving high
recall across multiple datasets. Furthermore, the incorporation of a FAISS-based L2 retrieval mechanism
ensures scalability and eficiency, allowing BioGITOM to manage millions of biomedical entities without
compromising accuracy.</p>
      <p>
        However, a limitation of the current version lies in its focus on equivalence mappings. While this
design ensures strong precision and balanced recall in equivalence-based tasks, it does not yet extend to
other semantic relationships such as subsumption or part-of relations, which are critical in hierarchically
rich biomedical ontologies. Addressing these relationships remains an open challenge for future work,
as also discussed in our recent publication [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
    </sec>
    <sec id="sec-12">
      <title>3.2. Discussion on Improvements for the Proposed System</title>
      <p>Building upon these results, several enhancements are being explored to further increase the versatility
and accuracy of BioGITOM. First, we aim to extend the system’s matching scope beyond equivalence
to encompass hierarchical (subsumption) and associative relationships, enabling richer and more
semantically expressive alignments. This expansion will make BioGITOM suitable for broader ontology
integration tasks, such as knowledge graph fusion and reasoning-based biomedical data linking.</p>
      <p>
        Second, we are investigating the transfer of learned concept representations into a hyperbolic
embedding space, motivated by the observation that Euclidean spaces inadequately preserve hierarchical
geometries inherent to biomedical ontologies. Hyperbolic spaces, in contrast, provide a more natural
geometric foundation for modeling tree-like and taxonomic structures, thereby reducing distortion
and improving the representation of complex ontological hierarchies. As reported in our recent
publication [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], such geometric transformations are expected to significantly enhance BioGITOM’s
capacity to capture nuanced structural dependencies and improve the accuracy of hierarchical ontology
alignment.
      </p>
      <sec id="sec-12-1">
        <title>4. Conclusion</title>
        <p>BioGITOM represents a novel and advanced approach to biomedical ontology matching, built upon
a hybrid Graph Isomorphism Transformer (GIT) architecture that integrates the strengths of Graph
Isomorphism Networks (GINs) and Graph Transformers (GTs). Supported by Sentence-SapBERT for
domain-specific semantic encoding and a FAISS-based retrieval mechanism, BioGITOM efectively
combines semantic and structural information to produce precise and scalable ontology alignments.</p>
        <p>Experimental evaluations on the OAEI 2025 Bio-ML benchmark demonstrate that BioGITOM
consistently outperforms competing systems across multiple biomedical datasets, achieving superior overall
performance and confirming its robustness and generalization capability. Nevertheless, the current
version focuses primarily on generating equivalence mappings, which limits its ability to capture other
semantic relations such as subsumption or part-of.</p>
        <p>Future work, will focus on extending BioGITOM to support a broader spectrum of semantic
relationships and exploring hyperbolic representation spaces to better model hierarchical ontological structures.
These enhancements aim to further improve the system’s versatility, interpretability, and accuracy,
reinforcing its role as a comprehensive solution for large-scale biomedical ontology alignment.</p>
      </sec>
      <sec id="sec-12-2">
        <title>Declaration on Generative AI</title>
        <p>During the preparation of this work, the authors used Grammarly in order to grammar and spell check,
and improve the text readability. After using the tool, the authors reviewed and edited the content as
needed to take full responsibility for the publication’s content.
Ontologies with Graph Isomorphism Transformer, The VLDB Journal 34 (2025). doi:10.1007/
s00778-025-00943-7.
[10] Y. Gu, X. Qu, Z. Wang, Y. Zheng, B. Huai, N. J. Yuan, Delving Deep into Regularity: A Simple
but Efective Method for Chinese Named Entity Recognition, in: M. Carpuat, M.-C. de Marnefe,
I. V. Meza Ruiz (Eds.), Findings of the Association for Computational Linguistics: NAACL 2022,
Association for Computational Linguistics, Seattle, United States, 2022, pp. 1863–1873. doi:10.
18653/v1/2022.findings-naacl.143.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shvaiko</surname>
          </string-name>
          , Ontology Matching, 2nd ed., Springer-Verlag,
          <year>2013</year>
          . doi:
          <volume>10</volume>
          .1007/ 978- 3-
          <fpage>642</fpage>
          - 38721- 0.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Oulefki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Berkani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Boudjenah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. E.</given-names>
            <surname>Kenai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mokhtari</surname>
          </string-name>
          ,
          <article-title>Ontology Matching Using Multi-head Attention Graph Isomorphism Network</article-title>
          , in: M.
          <string-name>
            <surname>Mosbah</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Kechadi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Bellatreche</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Gargouri</surname>
          </string-name>
          (Eds.),
          <source>Model and Data Engineering</source>
          , Springer Nature Switzerland, Cham,
          <year>2024</year>
          , pp.
          <fpage>200</fpage>
          -
          <lpage>213</lpage>
          . doi:
          <volume>10</volume>
          .1007/978- 3-
          <fpage>031</fpage>
          - 49333- 1_
          <fpage>15</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Oulefki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Berkani</surname>
          </string-name>
          ,
          <article-title>A GNN-Based Framework for Ontology Matching</article-title>
          , in: Model and Data Engineering: 13th International Conference, MEDI 2024, Naples, Italy,
          <source>November 18-20</source>
          ,
          <year>2024</year>
          , Proceedings, Springer-Verlag, Berlin, Heidelberg,
          <year>2025</year>
          , p.
          <fpage>183</fpage>
          -
          <lpage>197</lpage>
          . doi:
          <volume>10</volume>
          .1007/978- 3-
          <fpage>031</fpage>
          - 87719- 3_
          <fpage>14</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Oulefki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Berkani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Boudjenah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bellatreche</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mokhtari</surname>
          </string-name>
          ,
          <article-title>Concepts and relations features are all you need for embedding-based ontology matching</article-title>
          ,
          <source>in: Web Information Systems Engineering - WISE</source>
          <year>2024</year>
          : 25th International Conference, Doha, Qatar, December 2-
          <issue>5</issue>
          ,
          <year>2024</year>
          , Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>I</given-names>
          </string-name>
          , Springer-Verlag, Berlin, Heidelberg,
          <year>2024</year>
          , p.
          <fpage>416</fpage>
          -
          <lpage>430</lpage>
          . doi:
          <volume>10</volume>
          .1007/
          <fpage>978</fpage>
          - 981- 96- 0579- 8_
          <fpage>29</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Oulefki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Berkani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bellatreche</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Boudjenah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mokhtari</surname>
          </string-name>
          ,
          <article-title>Results for BioGITOM in OAEI 2024, in:</article-title>
          <source>Proceedings of the 19th International Workshop on Ontology Matching co-located with the 23rd International Semantic Web Conference (ISWC</source>
          <year>2024</year>
          ), Baltimore, USA, volume
          <volume>3897</volume>
          ,
          <year>2024</year>
          , pp.
          <fpage>104</fpage>
          -
          <lpage>109</lpage>
          . URL: https://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>3897</volume>
          /oaei2024_paper2.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>K.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jegelka</surname>
          </string-name>
          ,
          <source>How Powerful are Graph Neural Networks?</source>
          ,
          <year>2019</year>
          . URL: https://arxiv.org/abs/
          <year>1810</year>
          .00826. arXiv:
          <year>1810</year>
          .00826.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>E.</given-names>
            <surname>Min</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ananiadou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Rong</surname>
          </string-name>
          ,
          <article-title>Transformer for Graphs: An Overview from Architecture Perspective</article-title>
          ,
          <year>2022</year>
          . URL: https://arxiv. org/abs/2202.08455. arXiv:
          <volume>2202</volume>
          .
          <fpage>08455</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Johnson</surname>
          </string-name>
          , M. Douze,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jégou</surname>
          </string-name>
          ,
          <article-title>Billion-Scale Similarity Search with GPUs</article-title>
          ,
          <source>IEEE Transactions on Big Data</source>
          <volume>7</volume>
          (
          <year>2021</year>
          )
          <fpage>535</fpage>
          -
          <lpage>547</lpage>
          . doi:
          <volume>10</volume>
          .1109/TBDATA.
          <year>2019</year>
          .
          <volume>2921572</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Oulefki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Berkani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Boudjenah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bellatreche</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Mokhtari, BioGITOM: Matching Biomedical
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>