arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.3543cs.AI
收藏

生物网络频繁子图挖掘方法分类及面临的挑战

Classification of Approaches and Challenges of Frequent Subgraphs Mining in Biological Networks

Alzahra University(阿尔扎赫拉大学);Islamic Azad University, Qazvin Branch(伊斯兰阿扎德大学加兹温分校)

Mohammadreza Keyvanpour, Fereshteh Azizani

摘要:

理解生物网络的结构和动力学是系统生物学的重要挑战之一。此外,生物网络中越来越多的实验数据需要使用有效的方法来分析这些巨大的数据量。这种方法需要识别常见的模式来分析数据。由于生物网络可以用图来建模,因此常用模式的识别问题等价于一组图中频繁子图的挖掘问题。本文首先介绍了生物网络中频繁子组挖掘的挑战,并针对每一种挑战对现有的方法进行了分类。然后,基于它们应用于每个挑战的方法的类型来分析算法。

英文摘要:

Understanding the structure and dynamics of biological networks is one of the important challenges in system biology. In addition, increasing amount of experimental data in biological networks necessitate the use of efficient methods to analyze these huge amounts of data. Such methods require to recognize common patterns to analyze data. As biological networks can be modeled by graphs, the problem of common patterns recognition is equivalent with frequent sub graph mining in a set of graphs. In this paper, at first the challenges of frequent subgrpahs mining in biological networks are introduced and the existing approaches are classified for each challenge. then the algorithms are analyzed on the basis of the type of the approach they apply for each of the challenges.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑