.png){kind=icon}
返回
RASMA: a reverse search algorithm for mining maximal frequent subgraphs
.png){kind=icon}
OA
AI
DOI：10.1186/s13040-021-00250-1.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Background Given a collection of coexpression networks over a set of genes, identifying subnetworks that appear frequently is an important research problem known as mining frequent subgraphs. Maximal frequent subgraphs are a representative set of frequent subgraphs; A frequent subgraph is maximal if it does not have a super-graph that is frequent. In the bioinformatics discipline, methodologies for mining frequent and/or maximal frequent subgraphs can be used to discover interesting network motifs that elucidate complex interactions among genes, reflected through the edges of the frequent subnetworks. Further study of frequent coexpression subnetworks enhances the discovery of biological modules and biological signatures for gene expression and disease classification. Results We propose a reverse search algorithm, called RASMA, for mining frequent and maximal frequent subgraphs in a given collection of graphs. A key innovation in RASMA is a connected subgraph enumerator that uses a reverse-search strategy to enumerate connected subgraphs of an undirected graph. Using this enumeration strategy, RASMA obtains all maximal frequent subgraphs very efficiently. To overcome the computationally prohibitive task of enumerating all frequent subgraphs while mining for the maximal frequent subgraphs, RASMA employs several pruning strategies that substantially improve its overall runtime performance. Experimental results show that on large gene coexpression networks, the proposed algorithm efficiently mines biologically relevant maximal frequent subgraphs. Conclusion Extracting recurrent gene coexpression subnetworks from multiple gene expression experiments enables the discovery of functional modules and subnetwork biomarkers. We have proposed a reverse search algorithm for mining maximal frequent subnetworks. Enrichment analysis of the extracted maximal frequent subnetworks reveals that subnetworks that are frequent are highly enriched with known biological ontologies.
Keyword:
Biological networks
Subgraph enumeration
Frequent subgraphs
Maximal subgraphs
Reverse search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.1
论文数:
707
被引数:
1.5K
机构
引用论文
Privacy-preserving social network publication against friendship attacks.png)
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data miningIF0
PREAI
分享收藏Direct Involvement of Retinoblastoma Family Proteins in DNA Repair by Non-homologous End-JoiningCELL REPORTSOAAI
CELL REPORTSIF6.9
OAAI分享收藏
Activation of mitogen-activated protein kinase in estrogen receptor α-positive breast cancer cells in vitro induces an in vivo molecular phenotype of estrogen receptor α-negative human breast tumorsCANCER RESEARCHOAAI
CANCER RESEARCHIF16.6
OAAI分享收藏Coexpression analysis of human genes across many microarray data sets跨许多微阵列数据集的人类基因的共表达分析GENOME RESEARCHOAAI
GENOME RESEARCHIF5.5
OAAI分享收藏
查看更多内容