首页> 美国卫生研究院文献>BioData Mining >Grasping frequent subgraph mining for bioinformatics applications
【2h】

Grasping frequent subgraph mining for bioinformatics applications

机译:抓取频繁的子图挖掘以用于生物信息学应用

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

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.Electronic supplementary materialThe online version of this article (10.1186/s13040-018-0181-9) contains supplementary material, which is available to authorized users.
机译:在图数据中搜索有趣的公用子图是数据挖掘中经过充分研究的问题。子图挖掘技术着重于发现图中的模式,这些模式展现出特定的网络结构,这些结构在这些数据集中被认为是有趣的。哪些子图很有趣,哪些不很依赖于应用程序的定义。这些技术已经得到了广泛的应用,并且能够解决一系列生物学研究问题,从检测生物分子化合物组中常见的亚结构到发现大规模分子相互作用网络中的网络基序。到目前为止,有关子图挖掘的生物信息学应用的信息仍然散布在异类文献中。在这篇评论中,我们为生命科学家提供了子图挖掘的介绍。我们从生物信息学的角度概述了各种子图挖掘算法,并介绍了其潜在的生物医学应用程序。电子补充材料本文的在线版本(10.1186 / s13040-018-0181-9)包含补充材料,可供授权使用用户。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号