Exercises marked with (*) require further reading/search beyond the suggested texts.
1. Sort optimally the following genome using block interchanges:
+1 +3 +4 +7 +5 +6 +2
Answer:
According to the summary shown in class:
Operation 1:
X = 2
Y = 7
Result:
+1 +2 +5 +6 +3 +4 +7
Operation 2:
X = 3
Y = 6
Result:
+1 +2 +3 +4 +5 +6 +7
According to the algorithm, we can see that just 2 operations are necessary to sort the given genome.
© 2015 Joao Meidanis