Skip to main content

Table 3 Summary of results for instances with two nonbinary trees

From: A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees

   

  TERMINUSEST

NONBINARYCYCLEKILLER

   

4-approx

7-approx

Contr.

Dataset

opt

Time

r ( N )

Time

Ratio

r ( N )

Time

Ratio

25%

Simple

7.168

12.971

7.240

43.967

1.032

16.338

2.463

2.343

 

Tricky

16.148

279.100

-

-

-

35.638

7.000

2.193

50%

Simple

5.933

11.150

5.900

41.325

1.030

13.721

2.004

2.405

 

Tricky

13.216

379.238

-

-

-

32.363

7.200

2.331

75%

Simple

3.654

1.121

3.729

4.208

1.015

9.075

1.483

2.590

 

Tricky

8.672

183.150

-

-

-

21.950

5.800

2.294

Worst case

20

600

29

600

1.5

56

22

4

  1. The layout of the table is the same as that of Table 2.