Skip to main content

Table 1 Expected number of spurious motifs in random instances for n=20,m=600. Here, represents value ≥1.0e+7

From: Efficient sequential and parallel algorithms for finding edit distance based motifs

l

d=0

1

2

3

4

5

6

7

8

9

10

11

12

13

5

0.0

1024.0

1024.0

          

6

0.0

4096.0

4096.0

         

7

0.0

14141.8

16384.0

        

8

0.0

225.8

65536.0

65536.0

       

9

0.0

0.0

262144.0

262144.0

      

10

0.0

0.0

1047003.6

1048576.0

     

11

0.0

0.0

1332519.5

4194304.0

    

12

0.0

0.0

294.7

1.678e+07

1.678e+07

   

13

0.0

0.0

0.0

6.711e+07

6.711e+07

  

14

0.0

0.0

0.0

2.517e+08

2.684e+08

 

15

0.0

0.0

0.0

2.749e+07

1.074e+09

16

0.0

0.0

0.0

139.1

4.295e+09

4.295e+09

17

0.0

0.0

0.0

0.0

1.718e+10

1.718e+10

18

0.0

0.0

0.0

0.0

3.965e+10

6.872e+10

19

0.0

0.0

0.0

0.0

1.226e+08

2.749e+11

2.749e+11

20

0.0

0.0

0.0

0.0

35.8

1.100e+12

1.100e+12

21

0.0

0.0

0.0

0.0

0.0

4.333e+12

4.398e+12

  1. The instances in bold represents challenging instances