ODES: an overlapping dense sub-graph algorithm

被引：3
|
作者：
Long, James [1 ]
Hartman, Chris [2 ]
机构：
[1] Univ Alaska Fairbanks, Int Arctic Res Ctr, Fairbanks, AK 99775 USA
[2] Univ Alaska Fairbanks, Dept Comp Sci, Fairbanks, AK 99775 USA
来源：
BIOINFORMATICS | 2010年 / 26卷 / 21期
基金：
美国国家科学基金会;
关键词：
BIOLOGICAL NETWORKS;
D O I：
10.1093/bioinformatics/btq514
中图分类号：
Q5 [生物化学];
学科分类号：
071010 ; 081704 ;
摘要：
Enumeration of the dense sub-graphs of a graph is of interest in community discovery and membership problems, including dense sub-graphs that overlap each other. Described herein is ODES (Overlapping DEnse Sub-graphs), pthreads parallelized software to extract all overlapping maximal sub-graphs whose densities are greater than or equal to a specified cutoff density of at least 1/2.
引用
收藏
页码：2788 / 2789
页数：2
相关论文
共 50 条
  • [1] An algorithm portfolio for the sub-graph isomorphism problem
    Battiti, Roberto
    Mascia, Franco
    [J]. ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007, 4638 : 106 - +
  • [2] A Quantum Algorithm for the Sub-graph Isomorphism Problem
    Mariella, Nicola
    Simonetto, Andrea
    [J]. ACM TRANSACTIONS ON QUANTUM COMPUTING, 2023, 4 (02):
  • [3] EFFECTIVE MINING ALGORITHM OF K-DENSE SUB-GRAPH IN COMPLEX NETWORK BASED ON PROBABILITY ATTRIBUTE GRAPH
    Zhang, Chunying
    Wang, Liya
    Liu, Baoxiang
    [J]. CONTROL AND INTELLIGENT SYSTEMS, 2015, 43 (02) : 82 - 87
  • [4] Protein complex prediction based on dense sub-graph merging
    Sahoo, Tushar Ranjan
    Vipsita, Swati
    Patra, Sabyasachi
    [J]. INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS, 2021, 26 (3-4) : 129 - 150
  • [5] Algorithm for detecting complete sub-graph in complex network
    Dept. of Electronic Machinery and Transportation Engineering, Guilin University of Electronic Technology, Guilin 541004, China
    不详
    [J]. Yi Qi Yi Biao Xue Bao, 2006, SUPPL. (925-927):
  • [6] Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient
    Cui, Yaozu
    Wang, Xingyuan
    Li, Junqiu
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 405 : 85 - 91
  • [7] A Control Task Assignment Algorithm based on sub-graph isomorphism
    Yu, Feng
    Li, Xixian
    Zhang, Huimin
    Wang, Li-e
    [J]. 2020 EIGHTH INTERNATIONAL CONFERENCE ON ADVANCED CLOUD AND BIG DATA (CBD 2020), 2020, : 265 - 271
  • [8] An algorithm for weighted sub-graph matching based on gradient flows
    Tao, Songqiao
    Wang, Shuting
    [J]. INFORMATION SCIENCES, 2016, 340 : 104 - 121
  • [9] Sub-graph degree-based bridge centrality algorithm
    Ezeh, Chinenye
    Tao, Ren
    Xu, Yan-Jie
    Sun, Shi-Xiang
    Zhe, Li
    [J]. INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2021, 32 (07):
  • [10] Connected Sub-graph Detection
    Qian, Jing
    Saligrama, Venkatesh
    Chen, Yuting
    [J]. ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 33, 2014, 33 : 796 - 804
12345