Skip to main content

Table 6 The computational complexity of ENNET and the other GRN inference methods

From: ENNET: inferring large gene regulatory networks from expression data using gradient boosting

Method

Complexity

ENNET

O(T P2N), T=5000

ADANET

O(C T P2N), C=30, T= P

GENIE3

O(T K P N logN), T=1000, K= P

C3NET

O(P2)

CLR

O(P2)

MRNET

O(f P2), f[1,P]

ARACNE

O(P3)

  1. The computational complexity of ENNET and the other GRN inference methods with respect to the number of genes P and the number of samples N. The computational complexity of CLR, MRNET, and ARACNE is given without calculating the Mutual Information matrix.