Table 1 Comparison of the different algorithms for solving the Ancestral co-evolution problem.
From: Efficient algorithms for reconstructing gene content by co-evolution
Method | Network Score | Running Time |
|---|---|---|
IP optimal | 0.06 | 7.6 hr |
LP rounded and not rounded | 0.06 | 6 hr |
FPT heuristic before greedy | 0.063102751 | 1.83 hr |
FPT heuristic | 0.060550424 | 2 hr |
IQP | – | fail (memory problems) |
Min-cut | – | more than a week |