Skip to main content

Table 3 Algorithmic complexity

From: A fast weak motif-finding algorithm based on community detection in graphs

Pattern-D

TimeO(·)

SpaceO(·)

Sample-D

TimeO(·)

SpaceO(·)

SPELLER

O(N2L N(l,d))

O(N2L/w)

iTriplet

O(N L3p(l,2d)l3d2)

O(N(l,d))

WEEDER

O(N2L N(l,d))

O(N2L/w)

RecMotif

≤O(N L7p(l,2d)10)

O(N2L)

MITRA

O(N L l N(l,d))

O(N L l)

VINE

O(N4L4)

O(N2L2)

   

TFBSGroup

O(p(l,x)2N4L4)

O(p(l,x)N2L2)