060-2015

MO640 - Multiple-choice question

The matrices below represent crossing results between 6 mutants, with:

0 = wild type cannot be recovered by this crossing
1 = wild type can be recovered by this crossing

Mark the alternative showing results compatible with deletion mutants satisfying the following conditions:

• in each mutant, the deleted region is contiguous
• the mutants 1-6 have been sorted according to their deleted regions' starting point

a) Matrices I and IV only
b) Matrices II and IV only
c) Matrices II and III only
d) Matrices I, II, and IV only
e) None of the above

Original idea by: Leandro Tacioli

059-2015

MO640 - Multiple-choice question

What is the minimum number of unique probes with which the following strictly overlapping graph of clones 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

058-2015

MO640 - Multiple-choice question

What is Benzer's approximate upper bound of the probability that a random 15x15 symmetric matrix can be arranged in dictionary order?

1) 1.28 * 10^(-4)
2) 3.07 * 10^(-6)
3) 4.22 * 10^(-8)
4) 3.29 * 10^(-10)
5) None of the above


Original idea by: Rafael Soares Padilha

088-2005

MO640 - Multiple-choice question

The following table represents the unichromosomal genomes of eight deletion mutants of a certain organism.  In each row, the underlined section is deleted in the corresponding mutant.

1. a b c d e f g h i j k l
2. a b c d e f g h i j k l
3. a b c d e f g h i j k l
4. a b c d e f g h i j k l
5. a b c d e f g h i j k l
6. a b c d e f g h i j k l
7. a b c d e f g h i j k l
8. a b c d e f g h i j k l

If experiments are carried out for each pair m, n of mutants to verify whether the wild type can be obtained (1) or not (0) by crossing m and n, which binary matrix below represents the expected results ?

A.  1 2 3 4 5 6 7 8 1 0 1 1 1 1 1 1 1 2 0 0 0 1 1 1 0 0 3 0 0 1 1 1 0 0 1 4 1 0 0 0 1 1 1 0 5 1 1 1 1 0 0 0 1 6 0 0 0 0 0 0 0 0 7 1 1 1 1 0 0 0 1 8 0 1 0 1 0 1 0 1

B.  1 2 3 4 5 6 7 8 1 0 0 1 1 1 1 1 1 2 0 0 1 0 1 0 0 1 3 1 1 0 1 0 1 0 1 4 1 0 1 0 1 0 0 1 5 1 1 0 1 0 0 0 1 6 1 0 1 0 0 0 0 1 7 1 0 0 0 0 0 0 1 8 1 1 1 1 1 1 1 0

C.  1 2 3 4 5 6 7 8 1 0 0 1 1 1 1 1 1 2 0 0 1 0 1 0 0 1 3 1 1 0 1 0 1 0 1 4 1 0 1 1 1 0 0 1 5 1 1 0 1 0 0 0 1 6 1 0 1 0 0 0 0 1 7 1 0 0 0 0 0 0 1 8 1 1 1 1 1 1 1 1

D.  1 2 3 4 5 6 7 8 1 0 0 0 0 0 0 0 0 2 0 0 1 0 1 0 0 1 3 1 1 0 1 0 1 0 1 4 1 0 1 0 1 0 0 1 5 1 1 0 1 0 0 0 1 6 1 0 1 0 0 0 0 1 7 1 0 0 0 0 0 0 1 8 1 1 1 1 1 1 1 0

E. NDA

Original idea by: Renata Martinelli Azzolini
Translation help by: Jessica Akemi Matsuoka

057-2015

MO640 - Multiple-choice question

What is the minimum number of operations to sort optimally by block interchanges the following genome?

+5 +1 +3 +4 +8 +9 +7 +6 +2

a) 6
b) 5
c) 4
d) 3
e) None of the above

Original idea by: Miriam Ito

056-2015

MO640 - Multiple-choice question

Consider the unichromosomal genome below:

+1 +6 +2 +4 +7 +5 +3

This genome can be optimally sorted with a certain number of block interchanges. What are the successive values for X when the standard algorithm for sorting by block interchanges, due to Christie, is applied, and what is the resulting Block Interchange Distance (BID)? (Consider X_i as the value used in the i-th iteration of the sorting algorithm).

A) X₁ = 2; X₂ = 3; X₃ = 4. BID = 3.
B) X₁ = 1; X₂ = 3; X₃ = 4; X₄ = 6. BID = 4.
C) X₁ = 2; X₂ = 4; X₃ = 5. BID = 3.
D) X₁ = 2; X₂ = 3; X₃ = 4; X₄ = 5. BID = 2.
E) None of the above.

Original idea by: Celso A. W. Santos

055-2015

MO640 - Multiple-choice question

Given the genome 1 8 3 9 7 6 2 5 4, what is its block interchange distance as defined by Christie (1996)?

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

Original idea by: Leandro José de Bortoli

054-2015

MO640 - Multiple-choice question

Consider the following genome π:



What is the value of D_DCJ(π,I) ÷ bid(π,I), where I is the identity genome on blocks 1 to 9, and bid is the block interchange distance?

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

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

053-2015

MO640 - Multiple-choice question

How many block interchanges(Christie 1996) is necessary to sort optimally the following genome?

+1 +5 +3 +2 +7 +4 +8 +6

a) 4
b) 6
c) 5
d) 3
e) None of the above.

Original idea by: Cristiano Borges Cardoso

052-2015

MO640 - Multiple-choice question

Select the alternative with the minimum number of block interchange operations that are needed to sort optimally the following genome:

+1 +8 +4 +7 +5 +2 +9 +6 +3 +10

a. 4.
b. 3.
c. 6.
d. 5.
e. None of the above.

Original idea by: Raphael Cristofaro

051-2015

MO640 - Multiple-choice question

What is the minimum number of block interchange operations needed to sort the following sequence?

3 1 4 6 2 5


A) 2 operations
B) 3 operations
C) 4 operations
D) 5 operations
E) None of the above


Original idea by: Rafael Padilha

027-2011

MO640 - Multiple-choice question

Considering the permutation product below, what is the structure of the result?

(4 2 5 1 3 6 8 7) (4 5 6 7 8) (7 6 5 4 3 2 1 8) (1 2 3)

a) The result is formed by a 2-cycle and a disjoint 4-cycle.

b) The result is a 4-cycle.

c) The result is formed by two disjont 4-cycles.

d) The result is a 6-cycle.

e) None of the above

 

 

050-2015

MO640 - Multiple-choice question

A possible value for the space V_*(.A.BC.) = {x | Bx = Cx} ∩ {x | Ax=Bx=Cx}^⊥ for the matrices below is:

A =

1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1

B =

0 0 0 1 0 1 0 0 0 0 1 0 1 0 0 0

C =

1 0 0 0 0 0 1 0 0 0 0 1 0 1 0 0

a) <[0 0 0 0]^t>
b) <[1 1 0 0]^t>
c) <[1 1 1 0]^t>
d) <[1 1 1 1]^t>
e) None of the above

Original idea by: Miriam Ito

026-2011

MO640 - Multiple-choice question

How many oriented pairs are there in the following genome?

(0 -5 -6 -1 -3 2 4 7)

a) 0
b) 2
c) 4
d) 6
e) None of the above

Original idea by: Felipe Holanda
Translation help by: Cicero Luiz Jr.

021-2011

MO640 - Multiple-choice question

According to Bergeron's elementary treatment of the Hannenhalli-Pevzner theory, which of the alternatives below represents the result of a reversal maximizing the resulting score when applied to  1 -5 2 6 4 -3 -8 7 ? 

     a)  1 -5 2 6 4 -3 -8 -7
     b)  1 -5 2 3 -4 -6 -8 7
     c)  1 -5 -4 -6 -2 -3 -8 7
     d)  1 -2 5 6 4 -3 -8 7
     e) None of the above.

Original idea by: Adriano Batista Prieto
Translation help by: Leandro José de Bortoli

049-2015

MO640 - Multiple-choice question

In view of Bergeron's elementary treatment of the Hannenhalli-Pevzner theory, what can be correctly stated about the following signed permutation?

6 7 4 5 1 2 3 8

a) it is sortable by applying Algorithm 1 only
b) it does not contain hurdles
c) it has 2 oriented pairs
d) its distance to the identity permutation is 3 reversals
e) None of the above


Original idea by: Mario Akita

048-2015

MO640 - Multiple-choice question

Given the signed, extended permutation 0 3 1 6 5 −2 4 7:

1. A possible oriented pair for this permutation is (6, 5). 
2. The score of the oriented pair (1, −2) for this permutation is 4. 
3. If we apply the reversal corresponding to (1, −2) to this permutation, the new permutation would have oriented pairs (−2, 3) and (5, −6).

Which statements are correct?

1. Only I 
2. Only II
3. Only II and III
4. Only III
5. None of the above

Original idea by: Jéssica Akemi Matsuoka

047-2015

MO640 - Multiple-choice question

Considering the permutations below:

Choose the alternative that correctly relates each permutation to an expression with the same value:

a) I - αβ; II - β; III - βα; IV - α

b) I - β; II - βα; III - α; IV - αβ

c) I - αβ; II - α; III - βα; IV - β

d) I - α; II - αβ; III - β; IV - βα

e) None of the above.

Original idea by: Mario Akita

046-2015

MO640 - Multiple-choice question

Consider the permutations α = (1 2 4)(7 5 8 9) and β = (2 4 7 9 1 8 5). The conjugation of β by α (αβα^-1) is:

a) (4 7 5 1 2 9 8)
b) (4 7 5 7 2 9 8)
c) (4 1 5 1 2 9 8)
d) (4 1 5 7 2 9 3)
e) None of the above

Original idea by: Miriam Ito

045-2015

MO640 - Multiple-choice question

What is the DCJ distance between the two genomes below?

a) 4
b) 5
c) 6
d) 7
e) None of the above.




Original idea by: Cristiano Borges Cardoso

044-2015

MO640 - Multiple-choice question

Consider the following adjacency graph:

The correct representation for genomes A and B and the DCJ distance between them are:

A) dist_DCJ = 3


B)  dist_DCJ = 4


C) dist_DCJ = 4
 

D) dist_DCJ = 5
 
E) None of the above.

 
Original idea by: Celso A. W. Santos