Skip to main content
. 2009 May 28;10:163. doi: 10.1186/1471-2105-10-163

Table 1.

An unsupervised algorithm for mining FCGs mapped from miRNA co-expression networks

Input: An FCG Inline graphic = (V, Inline graphic, Ω), a lower density threshold = δlower and a density decay constant ξ.
Output: A set of k number of PMs {Inline graphic}.
Formal steps:
1: Set t ← 0
2: Set δt ← 1
3: while δt δlower do
4: Find the largest PM, Inline graphic, from Inline graphic with respect to the association density δt
5: if Inline graphicɸ then
6: V V - Inline graphic
7: Inline graphic
8: end if
9: t t + 1
10: δt δt(1 - ξ)
11: end while
12: k t