Journal article Open Access

Grasping frequent subgraph mining for bioinformatics applications

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


JSON-LD (schema.org) Export

{
  "description": "<p>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.</p>", 
  "license": "https://creativecommons.org/licenses/by/4.0/legalcode", 
  "creator": [
    {
      "affiliation": "Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium", 
      "@type": "Person", 
      "name": "Mrzic, Aida"
    }, 
    {
      "affiliation": "Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium", 
      "@id": "https://orcid.org/0000-0001-5903-633X", 
      "@type": "Person", 
      "name": "Meysman, Pieter"
    }, 
    {
      "affiliation": "Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium", 
      "@id": "https://orcid.org/0000-0002-3105-1359", 
      "@type": "Person", 
      "name": "Bittremieux, Wout"
    }, 
    {
      "affiliation": "Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium", 
      "@type": "Person", 
      "name": "Moris, Pieter"
    }, 
    {
      "affiliation": "Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium", 
      "@type": "Person", 
      "name": "Cule, Boris"
    }, 
    {
      "affiliation": "Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium", 
      "@type": "Person", 
      "name": "Goethals, Bart"
    }, 
    {
      "affiliation": "Department of Mathematics and Computer Science, University of Antwerp, Antwerp, Belgium", 
      "@id": "https://orcid.org/0000-0002-8217-2564", 
      "@type": "Person", 
      "name": "Laukens, Kris"
    }
  ], 
  "headline": "Grasping frequent subgraph mining for bioinformatics applications", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "datePublished": "2018-09-03", 
  "url": "https://zenodo.org/record/3551511", 
  "@context": "https://schema.org/", 
  "identifier": "https://doi.org/10.1186/s13040-018-0181-9", 
  "@id": "https://doi.org/10.1186/s13040-018-0181-9", 
  "@type": "ScholarlyArticle", 
  "name": "Grasping frequent subgraph mining for bioinformatics applications"
}
14
22
views
downloads
Views 14
Downloads 22
Data volume 49.7 MB
Unique views 14
Unique downloads 21

Share

Cite as