Skip to main content

Table 1 Comparisons of TFBSGroup with state-of-art algorithms on ( l , d ) samples

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

(l,d)

SPE-

WEEDER

MI-

iTri-

Rec-

TFBSGroup(x)-

VINE

sMCL

 

LLER

(q)

TRA

plet

Motif

1/5/10/b10/f

  

(10, 2)

18.83s

3.7s (20)

1.98s

0.17s

0.64s

17.2s(3)

*

15s

      

29/30/30/0/70

  

(11, 2)

17.33s

3.47s (20)

2s

0.28s

0.13s

14s(3)-1

8s

*

      

99/100/100/0/0

  

(11, 3)

4.52m

20.02s (17)

22.95s

9.78s

1.56m

14s(3)-1

*

*

      

76/86/87/6/7

  

(12, 3)

4.5m

6.63m (16)

22.92s

4.89s

0.59s

15.8s(4)-1

7s

24s

      

68/72/72/0/28

  

(13, 3)

4.54m

2.77m (18)

22.73s

1.28s

0.22s

15.6s(4)-1

*

*

      

97/100/100/0/0

  

(14, 4)

1.04h

34.97m (19)

4.3m

1.09m

18.3s

17s(5)-1

*

1.63m

      

88/94/94/1/5

  

(15, 4)

1.04h

7.2m (19)

4.28m

5.79s

0.70s

15.9s(5)-1

5.6m

*

      

95/98/99/0/1

  

(15, 5)

-

4.09h (19)

43.86m

11.5m

-

18.8s(5)-1

6.8m

*

      

70/94/94/0/6

  

(16, 5)

-

4.2h (19/f)

44.53m

3.78m

24.34m

18s(6)-1

6.8m

4.22m

  

8.19h (18)

   

96/100/100/0/0

  

(17, 6)

-

-

7.0h

4.58h

-

18.6s(7)-1

7.5m

*

      

81/90/92/2/6

  

(18, 6)

-

1.39h (20/f)

7.46h

27.86m

-

19.2s(7)-1

*

10.53m

  

4.26h (19)

   

94/100/100/0/0

  

(19, 7)

-

-

-

-

-

19.6s(8)-1

8.3m

*

      

83/100/100/0/0

  

(21, 8)

-

-

-

-

-

21.4s(9)-2

10.6m

*

      

90/100/100/0/0

  

(23, 9)

-

-

-

-

-

20.2s(10)-1

12.1m

*

      

86/100/100/0/0

  

(24, 8)

-

-

-

-

-

21.3s(11)-1

*

*

      

97/100/100/0/0

  

(25, 10)

-

-

-

-

-

22.1s(12)-1

13.4m

*

      

90/100/100/0/0

  

(40, 14)

-

-

-

-

4.28h

27.2s(21)-1

*

*

      

98/100/100/0/0

 Â