位置：成果数据库 > 会议 > 会议详情页
Mining Maximal Frequent Dense Subgraphs Without Candidate Maintenance in PPI Networks
  • 所属机构名称：西北工业大学
  • 成果类型：会议
  • 相关项目：基于图挖掘的蛋白质功能预测算法的研究
同会议论文项目
基于图挖掘的蛋白质功能预测算法的研究
期刊论文 12 会议论文 9
同项目会议论文
Using Direct and Indirect Neighbours to Predict Protein Function in GO-evaluated PPI Data Set
MMCluster: Mining Maximal Bicluster without Candidate Maintenance in Microarray Dataset
Mining Frequent Dense Subgraphs Based on Extending Vertices from Unbalanced PPI Networks
Strong Association Rules Mining Without Using Frequent Items for Microarray Analysis
FDCluster： Mining frequent closed discriminative bicluster without candidate maintenance in multiple
A New Measure Based on Gene Ontology for Semantic Similarity of Genes
Mining Frequent Correlated-Quasi-Cliques From PPI Networks
WDGCluster Mining differential bicluster based on weighted graph in microarray dataset