Skip to main content

Table 2 Summary of results for instances with one binary and one nonbinary tree

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

      TERMINUSEST NONBINARYCYCLEKILLER
    4-approx 6-approx
Contr. Dataset opt Time r ( N ) Time Ratio r ( N ) Time Ratio
25% Simple 7.504 8.004 7.567 0.967 1.007 11.421 0.996 1.532
  Tricky 17.000 203.650 17.288 3.675 1.003 27.238 3.638 1.600
50% Simple 6.736 9.896 6.829 0.942 1.008 10.900 0.925 1.639
  Tricky 14.976 374.263 16.288 3.388 1.006 26.413 3.438 1.640
75% Simple 5.139 12.304 5.263 0.867 1.011 8.692 0.963 1.659
  Tricky 10.500 391.575 13.475 3.263 1.006 23.200 3.275 1.633
Worst case 20 600 22 15 1.75 37 13 3  
  1. We list the average hybridization number found (opt and r(N)), the average running time in seconds (Time) and where applicable the average approximation ratio (Ratio) for the three algorithms.