<!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>Publishing Diachronic Life Science Linked Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Katerina Gkirtzou</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Thanasis Vergoulis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Artemis Hatzigeorgiou</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Timos Sellis</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Theodore Dalamagas</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IMIS, Research Center \Athena"</institution>
          ,
          <addr-line>Athens</addr-line>
          ,
          <country country="GR">Greece</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>RMIT University</institution>
          ,
          <addr-line>Melbourne</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Thessaly</institution>
          ,
          <addr-line>Volos</addr-line>
          ,
          <country country="GR">Greece</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The Linked Data paradigm involves practices to publish, share, and connect data on the Web. Thus, it is a compelling approach for the dissemination and re-use of scienti c data, realizing the vision of the so-called Linked Science. However, by just converting legacy scienti c data as Linked Data, we do not fully meet the requirements of data re-use. Scienti c data is evolving data. To ensure re-use and allow exploitation and validation of scienti c results, several challenges related to scienti c data dynamics should be tackled. In this paper, we deal with the publication of diachronic life science linked data. We propose a change model based on RDF to capture versioned entities. Based on this model we convert legacy data from biological databases as diachronic linked data. Our linked data server can assist biologists to explore biological entities and their evolution by either using SPARQL queries or navigating among entity versions. All services are publicly available at http://diana.imis.athena-innovation.gr/lod.</p>
      </abstract>
      <kwd-group>
        <kwd>microRNA</kwd>
        <kwd>RDF</kwd>
        <kwd>LD</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        As technology advances in scienti c hardware (e.g., sequencers), easing the
creation and consumption of large volumes of scienti c data, and as more scienti c
datasets are published and become available for potential data users, the
current trend moves towards open science data. Linked Data is a powerful and
compelling approach for spreading and consuming scienti c data, involves
practices how to publish, share, and connect data on the Web, and o ers a new way
of data integration and interoperability. The driving force to implement Linked
Data spaces is the RDF technology1. The basic principles of the Linked Data
paradigm is (a) use the RDF data model to publish structured data on the Web,
and (b) use RDF links to interlink data from di erent data sources. Linked Data
technologies have given rise to the Web of Data: \a Web of things in the world,
described by data on the Web" [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>However, by just converting legacy scienti c data to Linked Data (LD), we
do not fully meet the requirements of data re-use. To ensure the e ciency in data
1 http://www.w3.org/RDF/
re-use and allow both the exploitation and validation of scienti c results, several
challenges related to the dynamics of scienti c data must be tackled. Scienti c
data is diachronic data. Thus, users (a) should have access not only to up-to-date
scienti c LD, but to any of the previous versions and (b) should also be able to
track the changes among versions, as well as their causes and e ects. In this
paper, we describe our work on publishing diachronic life science data, and more
speci cally, genomic, experimental and bibliographic data related to miRNA
molecules. We have integrated data from well-known databases, tracked their
evolution, and published them as diachronic linked data. We propose a change
model based on RDF to capture versioned entities. Our linked data server can
assist biologists to explore biological entities and their evolution.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Background</title>
      <p>MicroRNAs The discovery of microRNAs (miRNAs) in early 2000s has
dramatically changed the view of biologists about the role of the so-called junk DNA.
miRNAs bind themselves to message RNA (mRNA) transcripts, called targets,
and regulate their expression. Knowledge of miRNA targets is very important for
therapeutic uses. For example, such knowledge could be used to down-regulate
genes by introducing arti cial miRNAs into the cells. Since the terms \miRNA"
is nowadays used in a wide scope, it is common to distinguish between hairpin
miRNAs and mature miRNAs, or just hairpins and matures from now on. The
former signi es a precursor of the latter. A hairpin can actually be processed
into several matures. Matures bind themselves to transcripts and prevent the
creation of functional ribosomes.</p>
      <p>Diachronic miRNA data During the past years, we have developed DIANA
tools2, a set of advanced Web applications supporting a series of sophisticated
work- ows enabling users with no strong background in informatics to perform
advanced multi-step functional miRNA analysis. Under the hood of DIANA tools
lies a relational database storing information for key entities of the miRNA
domain, such as hairpins, matures, transcripts, genes, KEGG pathways, and
publications. Information has been aggregated from a variety of sources, i.e
information concerning the miRNAs comes from the miRBase database (up to v.18)3,
gene related information from the Ensembl database (v.69)4 and molecular
interaction and reaction networks from KEGG pathways database5.</p>
      <p>The miRBase database is a searchable database of published miRNAs and
maintains information for 18; 589 hairpins and 21; 881 matures. It also maintains
a list of les that record successive versions along with the changes between
them. By examining all these les, a number of changes are observed.
Analytically, we observe the following changes: (a) NAME/SEQUENCE : change
2 http://diana.imis.athena-innovation.gr/DianaTools/index.php
3 http://www.mirbase.org/
4 http://www.ensembl.org/index.html
5 http://www.genome.jp/kegg/pathway.html
over the values of name and sequence respectively for both hairpins and
matures, (b) NEW/DELETE : creation and deletion of a hairpin/mature entry,
(c) FORWARD : merging of multiple hairpin entries into a single one, (d) ADD
HAIRPIN PARENT/REMOVE HAIRPIN PARENT : creation/deletion of the
relationship among a pair of hairpin and mature. Being able to track the changes
of the miRNA and having access to older versions it is a crucial information when
working with miRNAs. For example, the hairpin MI0001364 was introduced into
miRBase at v5.0 with name dre-mir-10b and at v7.0 its name changed to
dre-mir10b-1. Having access to all possible names, allows us to better track bibliographic
references independent of its latest name.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Change model based on RDF</title>
      <p>A challenging problem in LD publishing is how to deal with evolving data. In
the general case, changes are complex objects that interact with data objects,
they can have structural, temporal and probabilistic characteristics, thus they
cannot be handled as plain di erences neither transformation operations between
datasets. This is evident especially in life science LD, since by just converting
legacy scienti c data as LD, we do not fully meet the requirements of data
reuse. To support the above requirements, we adopt versioned RDF entities and
version properties, and we also model changes as rst class citizens, i.e. RDF
resources, in the LD itself. Based on our approach, both query and navigation
services can be developed on top of diachronic LD sets.
3.1</p>
      <p>Versioned entities and properties
To represent up-to-date RDF descriptions, we use a general URI that is based
on the class of the resource and an id that uniquely identi es the resource:
http://.../resource/class-name/resource-id. By using such URIs, one can
retrieve the RDF description for the current version of a requested RDF
resource. To retrieve the RDF description for an RDF resource in a previous
version of the LD set, we use version timestamps to append the general URIs:
http://.../resource/class-name/resource-id/timestamp. For example, the
URI http://.../resource/matures/MIMAT0009477 retrieves the current
version of the mature with id MIMAT0009477, while http://.../resource/matures/
MIMAT0009477/17 the description of the same mature for v17.</p>
      <p>While versioned URIs support the navigation among versioned entities by
following those URIs, we use four version properties to facilitate the querying
of diachronic LD set: (a) :label, with the constant value "now", (b) :version,
with version timestamp values, (c) :previousVersion, and (d) :nextVersion.
The rst property can be used in SPARQL to provide access only to the current
version of the RDF resources, while the second can be used to form queries that
span several versions of the LD set. The other two properties are used to ease the
navigation among di erent resource's versions back and forward, respectively.
A key requirement for diachronic LD is the need to trace the origins of data and
transformations that occurred. Capturing the changes themselves and having
querying capabilities on them, actually give us the possibility to step back and
examine how and when the changes took place. In other words, it opens the key
challenging problem of preservation and provenance support. Our approach uses
the RDF schema itself to represent changes. We propose two di erent strategies
depending whether the change occurs in an RDF triple that involves a property
with a literal object or a property connecting two resources.</p>
      <p>Property to Literal In this case, the literal value is substituted by a new value.
We model this change by adding to the RDF schema an extra property :change,
which is a property to literal and describes the type of change. Figure 2 shows
an RDF subgraph of the miRNA LOD, where a change occurs to the property
diana:name of the hairpin MI0000069 at v2.0. On the left side, we see its RDF
resource at the previous miRBase v1.5, which also contains the old name value
hsa-mir-15a (depicted in red), while on the right side we see the RDF resource
of the hairpin at miRBase version 2.0 with the new name value hsa-mir-15a
and the extra property diana:change with literal value the type of change {in
this case "NAME"{ that models the change itself (depicted in green).
Property to Resource In this case, the change is an RDF resource itself
that links to the two resources of the property (the subject and the object)
that changed. This \change" resource apart from links to the corresponding
resources, it contains also a time property, showing at which time point the change
occurred. Other characteristics, like probabilistic ones, can easily be modeled by
adding extra properties to the \change" resource. Figure 3 shows an RDF
subgraph of the miRNA LOD when a change occurs at property diana:producesMature
between the hairpin MI0000769 and the mature MIMAT0009199 at v17. At
the top of the Figure 3 we see the two connected RDF resources at the
previous v16 (depicted in red). At the bottom, we see the two resources at v17
where the property diana:producesMature has been dropped. To proper model
proper this change, we extend the RDF graph with an instance of the class
RemoveHairpinParent (depicted in green) that contains links to the respective
resources at v17.</p>
    </sec>
    <sec id="sec-4">
      <title>Publishing and exploring LD miRNA data</title>
      <p>
        All the curated information related to miRNAs for DIANA tools is stored in a
relational database, but a Linked Data representation is necessary and useful for
biologists. Such a LD representation will be open and available to everyone for
reuse, exploration and validation. Moreover, it can be used for inference and can be
potentially be part of an automated interpretation tool of the role of non-coding
RNAs. Due to the internal relational storage of the data, we adopt the \virtual
RDF" approach: accessing a non-RDF database using an RDF view. Such an
approach enables the access of non-RDF, legacy databases without having to
replicate the whole database into RDF. We use the D2R server [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], a popular
tool that follows this approach.
      </p>
      <p>In order to show the abilities of our proposed model and its exibility, we
present a number of SPARQL queries. The queries are categorized into the
following types: (a) retrieval of up-to-date entities, (b) retrieval of diachronic
entities and (c) change exploration. The retrieval of up-to-date entities requires the
triple pattern ?e diana:label "now" as mentioned at Section 3.1. The
following SPARQL query is an example of this type, retrieving the targets of miRNAs
predicted by microT-ANN and showing the whole biogenesis path. Thus, we get
the hairpin's URI, the URI of its produced mature and the transcript's URI that
is targeted by the mature.</p>
      <p>SELECT ?hairpin ?mature ?target WHERE
{
?hairpin rdf:type diana:Hairpin.
?hairpin diana:label "now".
?hairpin diana:producesMature ?mature.
?interaction rdf:type diana:Interaction.
?interaction diana:hasMature ?mature.
?interaction diana:hasTarget ?target.</p>
      <p>?interaction diana:application "microT-ANN (v4.0)".
}</p>
      <p>To retrieve diachronic data we need just to specify the period of interest. For
example, if we want to reproduce the previous query, but for a speci ed previous
miRBase version, e.g version 13.0, we have the following SPARQL query :
SELECT ?hairpin ?mature ?target WHERE
{
?hairpin rdf:type diana:Hairpin.
?hairpin diana:version "13.0".
?hairpin diana:producesMature ?mature.
?interaction rdf:type diana:Interaction.
?interaction diana:hasMature ?mature.
?interaction diana:hasTarget ?target.
?interaction diana:application "microT-ANN (v4.0)".</p>
      <p>Finally we present two examples of SPARQL queries that show the evolution
of data. The rst one retrieves the hairpins that changed their name throughout
their lifespan and returns the hairpin's URI, the miRBase version the name
changed, the old name value and the new name value:
SELECT ?hairpin ?version ?old_name ?new_name WHERE
{
?hairpin rdf:type diana:Hairpin.
?hairpin diana:change "NAME".
?hairpin diana:version ?version.
?hairpin diana:name ?new_name.
?hairpin diana:previousVersion ?hairpin_prev.
?hairpin_prev diana:name ?old_name.
In order to retrieve the old name values of the Hairpins, we can access the
previous version of the hairpin via the property diana:previousVersion. The second
one retrieves all currently not-related hairpin and mature pairs that used to be
related in the past and returns from left to right the hairpin's URI, the miRBase
version the property diana:producesMature dropped and the mature's URI :
SELECT DISTINCT ?hairpin ?version ?mature WHERE
{
?connection rdf:type diana:removeHairpinParent.
?connection diana:version ?version.</p>
      <p>FILTER (?version &lt;= "18").
?connection diana:hasHairpin ?hairpin.</p>
      <p>?connection diana:hasMature ?mature.</p>
      <p>Using the property diana:version in FILTER we can retrieve all changes in
the relationship between hairpin and mature miRNAs before that version. Note
also that since the property diana:producesMature connects two resources, a
change in that relationship-type property we model it as a new RDF class.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Related Work</title>
      <p>
        This work is an extension of [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which was our rst attempt to publish legacy
miRNA data as LD. Compared to that work, (a) we use a di erent database
schema in order to support a wider range of diachronic queries, and (b) we have
integrated new miRNA-related datasets. Various approaches have been proposed
in the bibliography studying the problems of evolution, versioning and change
detection in the context of LD. The Memento framework [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] handles di erent
versions of LD by attaching time-speci c attributes as global version
indicator. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] focuses on monitoring and examining the dynamics of LD, a knowledge
that can be leveraged to optimize existing systems and algorithms, especially
indexing techniques. Other publications, such as [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], deal with changes
in the linkages between datasets and the problem of broken links. A comparative
study of tools and approaches that deal with the problems of LD dynamics has
also been presented in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The survey studies the aspects of discovery, change
detection at several granularity level (i.e at the dataset level, at triple level, etc),
and description of the changes, as well as the detection algorithms and noti
cation mechanisms. Evolutionary Terminology Auditing (ETA) examines how
terminology changes re ect evolutions in the underlying domain. An example
of this work can be seen in the context of SNOMED CT in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Finally, named
graphs [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], RDF graphs which are assigned a name in the form of a URIref, allow
easier provenance tracking and trustness warranties.
6
      </p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion - Future Work</title>
      <p>
        In this paper we presented our work on the publication of diachronic life science
LD. More speci cally, we aggregated data from well known databases related to
miRNA molecules and exported as LD. The curated data contains information
from experimental observations, as well as change and version information about
the miRNA entities. The miRNA LD server can assist biologists to explore
biological entities, navigate between versions of the resources and via the SPARQL
endpoint it provides access to applications for querying historical miRNA data
and tracking their changes. As future work, we plan to interlink our linked data
set with the linked data provided by the EBI RDF Platform [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Futhermore, we
will focus on providing keyword search querying capabilities on LD.
Acknowledgments This study has been supported by LODGOV project, Research
Programme ARISTEIA (EXCELLENCE), General Secretariat for Research and
Technology, Ministry of Education, Greece and the European Regional Development Fund.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Applying</given-names>
            <surname>Evolutionary</surname>
          </string-name>
          <article-title>Terminology Auditing to SNOMED CT</article-title>
          .
          <source>In: AMIA 2010 Proceedings</source>
          . pp.
          <volume>96</volume>
          {
          <issue>100</issue>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heath</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Linked data - the story so far</article-title>
          .
          <source>International Journal on Semantic Web and Information Systems</source>
          <volume>5</volume>
          (
          <issue>3</issue>
          ),
          <volume>1</volume>
          {
          <fpage>22</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cyganiak</surname>
          </string-name>
          , R.:
          <article-title>D2r server publishing relational databases on the semantic web (</article-title>
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Carroll</surname>
            ,
            <given-names>J.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hayes</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stickler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Named graphs</article-title>
          .
          <source>Web Semantics: Science, Services and Agents on the World Wide Web</source>
          <volume>3</volume>
          (
          <issue>4</issue>
          ),
          <volume>247</volume>
          {
          <fpage>267</fpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Dalamagas</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bikakis</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Papastefanatos</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stavrakas</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hatzigeorgiou</surname>
            ,
            <given-names>A.G.</given-names>
          </string-name>
          :
          <article-title>Publishing life science data as linked open data: the case study of mirbase</article-title>
          .
          <source>In: WOD</source>
          . pp.
          <volume>70</volume>
          {
          <issue>77</issue>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Jupp</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malone</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bolleman</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brandizi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Davies</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garcia</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gaulton</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gehant</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Laibe</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Redaschi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wimalaratne</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Le</given-names>
            <surname>Novre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Parkinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Birney</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Jenkinson</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.M.:</surname>
          </string-name>
          <article-title>The EBI RDF Platform: Linked Open Data for the Life Sciences</article-title>
          .
          <source>Bioinformatics</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Popitsch</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haslhofer</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Dsnotify: handling broken links in the web of data</article-title>
          .
          <source>In: WWW</source>
          . pp.
          <volume>761</volume>
          {
          <issue>770</issue>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. de Sompel,
          <string-name>
            <given-names>H.V.</given-names>
            ,
            <surname>Sanderson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Nelson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.L.</given-names>
            ,
            <surname>Balakireva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Shankar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Ainsworth</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.:</surname>
          </string-name>
          <article-title>An http-based versioning mechanism for linked data</article-title>
          .
          <source>CoRR</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Umbrich</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hausenblas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hogan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polleres</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          : Towards Dataset Dynamics:
          <article-title>Change Frequency of Linked Open Data Sources</article-title>
          . In: LDOW (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Umbrich</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villazn-Terrazas</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hausenblas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Dataset dynamics compendium: A comparative study</article-title>
          .
          <source>In: COLD</source>
          . vol.
          <volume>665</volume>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Volz</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gaedke</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kobilarov</surname>
          </string-name>
          , G.:
          <article-title>Discovering and maintaining links on the web of data</article-title>
          .
          <source>In: ISWC 2009</source>
          . pp.
          <volume>650</volume>
          {
          <issue>665</issue>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>