Table 4 Enrichment analysis of maximal cohesive subgraphs
From: A linear delay algorithm for enumerating all connected induced subgraphs
S min | N | \(\overline {N}\) | \(\overline {Density}\) | H a l l m a r k % | K E G G % | O n c o % | D i s G e N e t % |
|---|---|---|---|---|---|---|---|
1 | 28 | 798.6 | 0.185 | 68 | 71 | 79 | 93 |
2 | 260 | 124.5 | 0.19 | 65 | 77 | 59 | 91 |
3 | 642 | 58.5 | 0.147 | 67 | 72 | 65 | 89 |
4 | 816 | 43.5 | 0.123 | 76 | 78 | 74 | 92 |
5 | 705 | 37.0 | 0.106 | 83 | 82 | 80 | 96 |
6 | 429 | 31.2 | 0.104 | 88 | 86 | 84 | 99 |
7 | 183 | 25.9 | 0.113 | 89 | 88 | 84 | 99 |
8 | 72 | 20.7 | 0.125 | 92 | 86 | 89 | 99 |
9 | 32 | 15.3 | 0.154 | 91 | 78 | 81 | 100 |