Skip to main content

Table 1 Elapsed-time and speed-up comparisons of FredNava , ACSMF , and ACSMF-Simple for n =1MB

From: Fast algorithms for approximate circular string matching

  

Elapsed Time (s)

Speed-up of ACSMF-Simple

m

k

FredNava

ACSMF

ACSMF-Simple

FredNava

ACSMF

100

5

1.63

0.40

0.06

27

7

200

5

6.77

0.40

0.05

135

8

300

5

16.84

0.41

0.05

337

8

400

5

31.99

0.41

0.05

640

8

500

5

53.26

0.41

0.05

1065

8

600

5

81.35

0.41

0.05

1627

8

700

5

116.24

0.41

0.05

2325

8

800

5

158.73

0.41

0.06

2645

7

900

5

206.43

0.42

0.06

3440

7

1000

5

264.84

0.41

0.06

4414

7

100

10

1.65

0.43

0.05

33

9

200

10

6.94

0.40

0.05

139

8

300

10

16.55

0.41

0.05

331

8

400

10

31.70

0.40

0.05

634

8

500

10

53.11

0.41

0.05

1062

8

600

10

81.04

0.40

0.05

1620

8

700

10

116.25

0.41

0.06

1937

7

800

10

158.1

0.41

0.06

2635

7

900

10

207.33

0.41

0.05

4146

8

1000

10

264.11

0.41

0.05

5282

8

100

15

1.65

0.42

0.06

28

7

200

15

6.91

0.41

0.06

115

7

300

15

16.45

0.41

0.06

274

7

400

15

31.48

0.41

0.05

630

8

500

15

52.55

0.41

0.05

1051

8

600

15

80.46

0.41

0.05

1069

8

700

15

115.86

0.41

0.06

1931

7

800

15

157.81

0.41

0.06

2630

7

900

15

206.56

0.42

0.06

3443

7

1000

15

262.16

0.42

0.06

4369

7