Size

Instances

D_{
ex
}−D_{
AS
}

D_{
ex
}/D_{
AS
}

R_{
AS
}−R_{
ex
}

R_{
AS
}/R_{
ex
}


12–50

117

0.21

1.03

0.47

1.04

100

10

0

1

0

1

200

8

0

1

0

1

300

10

0

1

0.1

1

500

6

0

1

0

1

All sizes

151

0.17

1.02

0.37

1.04

 We analyze the 151 instances where the exact algorithm produced genomes and ASMedianlinear executed within the resource bounds. D _{
ex
} (resp. R _{
ex
}) is the DCJ score (resp. rank score) of the solution generated by the exact algorithm. D _{
AS
} (resp. R _{
AS
}) is the DCJ score (resp. rank score) of the solution generated by ASMedianlinear. Each entry shows the average value for all instances of the corresponding size (first column). The number of instances in each size range are shown in the “Instances” column. Notice that all scores are very close. The average difference never surpasses 0.5, and the average ratio is always within 4% of 1. Since the exact algorithm produces optimum rank scores and ASMedianlinear produces optimum DCJ scores, we always use the smaller score as reference. Therefore, all differences are nonnegative and all ratios are greater than or equal to 1