Skip to main content

Advertisement

Table 1 Experimental results

From: An asymmetric approach to preserve common intervals while sorting by reversals

Perm. Algorithm N S N T Exec. time
A, 8 d = 8 all (A8) 81, 869 377 5 s
  prf(A8) 51,304 92 5 s
  prg (A8) 11, 568 12 3 s
  prg (8A) 8, 400 5 2 s
B, 16 d = 12 all (B16) 505, 634, 256 21, 902 7.3 m
  prf (B16) 122, 862, 960 171 27 s
  prg (B16) 5, 963, 760 6 14 s
  prg (16B) 5, 393, 520 9 16 s
  1. The experimental results of computing traces (all), perfect traces (prf) and progressive perfect subtraces (prg; in both directions), considering the pairs of permutations (A, 8) and (B, 16), where A = (-5, -2, -7, 4, -8, 3, 6, -1) and B = (-12, 11, -10, -1, 16, -4, -3, 15, -14, 9, -8, -7, -2, -13, 5, -6).
  2. The columns N S and N T give, respectively, the resulting number of sorting sequences and traces for each approach. All algorithms are part of the BAOBABLUNA package [22]. Experiments were made on a 64 bit personal computer with two 3GHz CPUs and 2GB of RAM and the execution time is given in seconds (s) or minutes (m).