week 15

Considering the PQR tree below, which of the alternatives contains sets that do NOT belong to the tree's complete collection?

a) { M N } and { M O }
b) { C D } and{ K L }
c) { A B }, { J K } and { L M }
d) { E F G }, { G H } and { H I }
e) None of the above.

Original idea by: Daniel M. Ivasse
Translation Help by: Mario Akita

week 14

Guiven the PQ-tree T below, analyze the statements:

I) T is consistent.
II) FRONTIER(T) is the permutation ABCDEFGHIJKLMNOP.
III) T is PERTINENT(T,S) if S={A,B,G,K,M}
IV) T is PRUNED (T,S) if and only if S contains all the leaves of the tree.

Which statements are correct?

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

Original Idea by Mario Akita

week 13

Considering the statements below about Benzer, 1959 study:

I - A qualitative approach to studying mutations was used rather than a quantitative one.
II - Mutations at a region called "rII" of a virus were used to demonstrate the theory.
III - The author was interested in whether or not two individuals had mutations that overlap.
IV - According to the definition of overlapping mutations, it is possible to recover the original genome if and only if the mutants have overlapping mutations.
V- The recombination matrix is devised by assigning 1 for the matrix element a[i,j] if they have an overlapping mutation and 0 otherwise,

How many statements are true?

a) 1
b) 2
c) 3
d) 4
e) None of the above.

Original idea by Mario Akita

week 12

Consider a genome below that will be sorted using the block interchange method.

1 8 3 6 4 3 2 9 7 5

It is correct that:

I - The sequence can be sorted in 4 steps.
II-  No negative numbers will appear during the process of sorting though block interchanges.
III-  Sorting through block interchange takes less steps than sorting this same sequence though  reversals.

Which statements are correct?

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

Original idea by Mario Akita

week11

Considering the permutation

(6 7 4 5 1 2 3 8)

it is correct to affirm that:

a) it is sortable by just applying Algorith 1 from Bergeron, 2005
b) does not contain hurdles
c) has 2 oriented pairs
d) is sortable by applying 3 reversions
e) None of the above

Original idea by Mario Akita

week 10

A genome underwent a operation that changed it as showed by the representations below:

Before:
π_adj = (-A B) (-B D) (-D C) (-C -F)

After:
π_adj = (-D C) (-C -F) (F A) (-A B) (-B D)

What operation happened?

a) Linear fission
b) Circularization
c) Reversal
d) Transposition
e) None of the above

Original idea by: Mario Akita

week 9

Considering the graphs below that represent permutations and the results of operation with permutations:

Choose the alternative that correctly relate the graph to its operation:

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.