Skip to main content

Table 8 Average running time for IDQPSO, Simulated Annealing and GRAPPA

From: Achieving large and distant ancestral genome inference by using an improved discrete quantum-behaved particle swarm optimization algorithm

Program Running time (s) (No transposition)
r = 20 r = 40 r = 60 r = 80 r = 100 r = 120 r = 140 r = 160 r = 180
IDQPSO-Median 118.1 138.7 178.0 295.6 835.9 19,839.4 \(>7\) days \(>7\) days \(>7\) days
SA-Median 167.4 298.6 577.1 1361.7 7930.5 42,249.7 \(>7\) days \(>7\) days \(>7\) days
GRAPPA-Exact 107.3 109.1 122.4 365.3
Program Running time (s) (90% inversions/10% transpositions)
r = 20 r = 40 r = 60 r = 80 r = 100 r = 120 r = 140 r = 160 r = 180
IDQPSO-Median 114.9 135.4 238.3 1096.3 6556.1 32,388.5 \(>7\) days \(>7\) days \(>7\) days
SA-Median 155.6 398.7 746.7 7429.0 26,607.9 164,978.2 \(>7\) days \(>7\) days \(>7\) days
GRAPPA-Exact 113.0 113.9 4158.3
  1. For \(r\ge 140\), both IDQPSO and Simulated Annealing are stopped after 5 days of computation
  2. The best values of all the compared algorithms are indicated in italics