Regarding the paper "On the consecutive ones property" by Meidanis et al. (1998), and the algorithm that leads to the construction of PQR trees:
I - The algorithm is ONLINE
II - The overall running time of the algorithm is quadratic
III - The algorithm always constructs a PQR tree given a set and a collection (set of sets)
Which of the statements are correct?
a) Only I
b) Only II
c) Only III
d) Only II and III
e) None of the above
Original idea by: Gustavo Waku
Translation help by: Leandro Tacioli
Friday, June 12, 2015
Thursday, June 4, 2015
Multiple Choice Question - 05/Jun/2015
According to the concept of equivalence transformations by Booth and Lueker (1976), which alternative DOES NOT represent a PQ-tree equivalent to the following tree?
Original idea by: Leandro Tacioli
a)
b)
c)
d)
e) None of the above
Original idea by: Leandro Tacioli
Friday, May 29, 2015
Multiple Choice Question - 29/May/2015
Given the matrices below, which of the alternative represents matrices arranged in the "dictionary order" by Benzer (1959)?
a) Only I
b) Only I and IV
c) Only I, II and IV
d) Only II and IV
e) None of the above
Original idea by: Leandro Tacioli
a) Only I
b) Only I and IV
c) Only I, II and IV
d) Only II and IV
e) None of the above
Original idea by: Leandro Tacioli
Friday, May 22, 2015
Multiple Choice Question - 22/May/2015
In which of the following genomes is possible to sort using block interchanges?
a) +1 +5 +8 -2 +4 +3 -6 -7
b) -6 -1 -4 -2 -8 -3 -5 -7
c) +1 -2 -3 -4 -5 -6 -7 +8
d) +5 +4 +3 +1 -2 +6 +7 +8
e) None of the above
Original idea by: Leandro Tacioli
a) +1 +5 +8 -2 +4 +3 -6 -7
b) -6 -1 -4 -2 -8 -3 -5 -7
c) +1 -2 -3 -4 -5 -6 -7 +8
d) +5 +4 +3 +1 -2 +6 +7 +8
e) None of the above
Original idea by: Leandro Tacioli
Friday, May 15, 2015
Multiple Choice Question - 15/May/2015
Considering the permutation (0, 5, 3, -1, -4, 2) and the concepts shown in Bergeron 2005, choose the WRONG alternative.
a) The oriented pair (0, -1) has score = 1 and the oriented pair (-1, 2) has score = 0
b) The resulting reduced permutation of the reversal induced by oriented pair (-1, 2) is (0, 3, 2, 1)
c) The permutation contains four oriented pairs: (0, -1), (5, -4), (3, -4) and (-1, 2)
d) The resulting reduced permutation of the reversal induced by oriented pair (-1, 2) is equal to the resulting reduced permutation of the reversal induced by oriented pair (-3, 4). The same operation occurs with oriented pairs (0, -1) and (5, -4).
e) None of the above
Original idea by: Ulisses Martins Dias
Translation help by: Leandro Tacioli
a) The oriented pair (0, -1) has score = 1 and the oriented pair (-1, 2) has score = 0
b) The resulting reduced permutation of the reversal induced by oriented pair (-1, 2) is (0, 3, 2, 1)
c) The permutation contains four oriented pairs: (0, -1), (5, -4), (3, -4) and (-1, 2)
d) The resulting reduced permutation of the reversal induced by oriented pair (-1, 2) is equal to the resulting reduced permutation of the reversal induced by oriented pair (-3, 4). The same operation occurs with oriented pairs (0, -1) and (5, -4).
e) None of the above
Original idea by: Ulisses Martins Dias
Translation help by: Leandro Tacioli
Friday, May 8, 2015
Multiple Choice Question - 08/May/2015 - Question 02
Considering the cycle of a linear chromosome as self-reverse-complementary, what is the chromosomal algebraic representation for the genome π?
a) πchr = (A B -C X Y) (Z -D E) (-F W)
b) πchr = (A B -C X Y Z -D E -F W)
c) πchr = (-A -B C X Y -Y -X -C B A) (-Z D -E E -D Z) (F -W W -F)
d) πchr = (-A -B C X Y -Y -X -C B A -Z D -E E -D Z F -W W -F)
e) None of the above
Original idea by: Leandro Tacioli
a) πchr = (A B -C X Y) (Z -D E) (-F W)
b) πchr = (A B -C X Y Z -D E -F W)
c) πchr = (-A -B C X Y -Y -X -C B A) (-Z D -E E -D Z) (F -W W -F)
d) πchr = (-A -B C X Y -Y -X -C B A -Z D -E E -D Z F -W W -F)
e) None of the above
Original idea by: Leandro Tacioli
Multiple Choice Question - 08/May/2015 - Question 01
What is the main difference between the DCJ distance and the Algebraic distance formulas?
a) The DCJ distance formula considers only odd paths while the Algebraic distance formula considers only even paths
b) The DCJ distance formula considers only odd paths while the Algebraic distance formula considers all paths
c) The DCJ distance formula considers only even paths while the Algebraic distance formula considers only odd paths
d) The DCJ distance formula considers all paths while the Algebraic distance formula considers only odd paths
e) None of the above
Original idea by: Leandro Tacioli
a) The DCJ distance formula considers only odd paths while the Algebraic distance formula considers only even paths
b) The DCJ distance formula considers only odd paths while the Algebraic distance formula considers all paths
c) The DCJ distance formula considers only even paths while the Algebraic distance formula considers only odd paths
d) The DCJ distance formula considers all paths while the Algebraic distance formula considers only odd paths
e) None of the above
Original idea by: Leandro Tacioli
Subscribe to:
Posts (Atom)