<!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>
      <article-id pub-id-type="doi">10.1145/2814864.2814893</article-id>
      <title-group>
        <article-title>Online Ontology Shortest Paths Searcher</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ondrˇej Zamazal</string-name>
          <email>ondrej.zamazal@vse.cz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Information and Knowledge Engineering University of Economics</institution>
          ,
          <addr-line>W. Churchill Sq.4, 130 67 Prague 3</addr-line>
          ,
          <country country="CZ">Czech Republic</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Entities within an ontology are connected via di erent paths. Connection of entities can be even considered within an ontology merged with its import closure constituting an ontology network. This demo paper presents a web-based tool for search of shortest path between entities in an ontology or an ontology network. Computing shortest paths is an important task for di erent graph based analysis and it can also support an user in his/her relationship exploration e ort.</p>
      </abstract>
    </article-meta>
  </front>
  <body />
  <back>
    <ref-list />
  </back>
</article>