[Q13] Consecutive ones property

What is the minimum number of probes with which the following strictly overlapping graph can be obtained?

1. 7
2. 8
3. 9
4. 10
5. None of the above.

Original idea by: Juan Felipe Hernández Albarracín.

[Q12] Block interchange

Consider the next genome π:



What is the value of D_DCJ(π,I) ÷ bid(π), where I is the identity permutation?

1. 1
2. 2
3. 3
4. 4
5. None of the above.

Original idea by: Juan Felipe Hernández Albarracín.

[Q11] The matrix median problem

What can we be sure about the matrix median approximations M(M_x ;A, B, C)?

1. It will never be lower than the real median score.
2. It will never be lower than 3/4 of the real median score.
3. It will never be higher than 4/3 of the real median score.
4. It will never be higher than the real median score.
5. None of the above.

Original idea by: Juan Felipe Hernández Albarracín.

[Q10] Genome rearrangements: algebraic distance, classic rearrangement operations

According to the definition of the permutation ρ = (u v)(π_chrΓv π_chrΓu) to perform two-break operations, which elements should u and v be, to turn π into σ?

 

1. u = -c, v = e
2. u = -c, v = -e
3. u = b, v = f
4. u = b, v = -f
5. None of the above.

Original idea by: Juan Felipe Hernández Albarracín.

[Q9] Genome rearrangements: algebraic distance, permutations

Let α be a 3-cycle and β be an arbitrary permutation. If two of the elements (a, b) of α are both in one cycle of β and the third element (c) is in another cycle, for the composition αβ :

1. The cycle with a and b of β breaks into two new cycles. The cycle with c remains the same.
2. The cycle with c breaks into two new cycles. The cycle with a and b recombines in a different cycle.
3. The two cycles recombines in two new cycles.
4. The two cycles of β join together into a new cycle.
5. None of the above.

Original idea by: Juan Felipe Hernández Albarracín.

[Q8] Genome rearrangements: double-cut-and-join distance

Let b and c be the number of breakpoints and cycles, respectively, as pointed by the breakpoint graph G for two genomes. Consider the next cases for the DCJ operation:

1. Cutting two black lines belonging to different cycles and then joining
2. Improper joining
3. Proper joining with no successive lines
4. Proper joining with successive lines in a cycle with two or more black lines
5. Proper joining with successive lines in a 2-cycle

In which of the cases above, performing the DCJ operation would decrease c?

1. Just in I and V
2. Just in II, IV
3. Just in I, III and V
4. Just in II, III and IV
5. None of the above.

Original idea by: Juan Felipe Hernández Albarracín.

[Q7] Genome rearrangements: weighted median

For a given adjacency α to appear in the weighted median of n genomes, and assuming that all of them have the same weight, it is required for α to be present in:

1. All genomes
2. At least n - 1 genomes.
3. At least the half of the genomes.
4. At least one more genome than their conflicting adjacencies.
5. None of the above.

Original idea by: Juan Felipe Hernández Albarracín.