Skip to main content

Table 1 Results on the elapsed time (seconds) for ordered and unordered trees of type A and B

From: Integer programming-based method for grammar-based tree compression and its application to pattern extraction of glycan tree structures

tree type

max degree

# vertices

ordered

unordered

m

time

m

time

A

2

11

7

0.021

7

0.019

A

2

31

10

302.74

10

329.20

A

2

41

10

8063.19

10

7730.64

A

2

51

12*

230.51

12*

233.44

B

3

7

9

0.011

8

0.010

B

6

19

11

0.185

10

1.108

B

8

25

11

1.404

10

26440.01

B

10

31

12

2.265

-

-

B

16

49

11

481.15

-

-

B

20

61

13

432.72

-

-

  1. Results on the elapsed time (seconds) for ordered and unordered trees of type A and B (in Figure 9) with several sizes. m was the same as the minimum number of nonterminal symbols for each tree, except the case denoted by ’*’. ’-’ denotes that the solver took more than 8 hours.