September 3, 2018 Journal article Open Access

Mrzic, Aida; Meysman, Pieter; Bittremieux, Wout; Moris, Pieter; Cule, Boris; Goethals, Bart; Laukens, Kris

MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <controlfield tag="005">20200120164235.0</controlfield>
  <controlfield tag="001">3551511</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium</subfield>
    <subfield code="0">(orcid)0000-0001-5903-633X</subfield>
    <subfield code="a">Meysman, Pieter</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium</subfield>
    <subfield code="0">(orcid)0000-0002-3105-1359</subfield>
    <subfield code="a">Bittremieux, Wout</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium</subfield>
    <subfield code="a">Moris, Pieter</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium</subfield>
    <subfield code="a">Cule, Boris</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium</subfield>
    <subfield code="a">Goethals, Bart</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium</subfield>
    <subfield code="0">(orcid)0000-0002-8217-2564</subfield>
    <subfield code="a">Laukens, Kris</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">2260874</subfield>
    <subfield code="z">md5:c45136341dfc8e101c548c8c4afed900</subfield>
    <subfield code="u">https://zenodo.org/record/3551511/files/Mrzic2018.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2018-09-03</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o">oai:zenodo.org:3551511</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="c">20</subfield>
    <subfield code="v">11</subfield>
    <subfield code="p">BioData Mining</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium</subfield>
    <subfield code="a">Mrzic, Aida</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Grasping frequent subgraph mining for bioinformatics applications</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://creativecommons.org/licenses/by/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;Searching for interesting common subgraphs in graph data is a well-studied problem in data mining. Subgraph mining techniques focus on the discovery of patterns in graphs that exhibit a specific network structure that is deemed interesting within these data sets. The definition of which subgraphs are interesting and which are not is highly dependent on the application. These techniques have seen numerous applications and are able to tackle a range of biological research questions, spanning from the detection of common substructures in sets of biomolecular compounds, to the discovery of network motifs in large-scale molecular interaction networks. Thus far, information about the bioinformatics application of subgraph mining remains scattered over heterogeneous literature. In this review, we provide an introduction to subgraph mining for life scientists. We give an overview of various subgraph mining algorithms from a bioinformatics perspective and present several of their potential biomedical applications.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1186/s13040-018-0181-9</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
</record>