Considering C = {abcd, bcdef, afghijk, bcdgh, ghijk}, choose the alternative that contains all twin sets of this collection:
a) abc, gh, ijk.
b) bcd, ef, hij.
c) bcd, gh, ghi.
d) bcd, gh, ijk.
e) None of the above
Original idea by: Victor de Abreu Iizuka
sexta-feira, 12 de junho de 2015
sexta-feira, 5 de junho de 2015
quinta-feira, 21 de maio de 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.
+1 +5 +3 +2 +7 +4 +8 +6
a) 4
b) 6
c) 5
d) 3
e) None of the above.
sexta-feira, 8 de maio de 2015
sexta-feira, 1 de maio de 2015
MO640 - Multiple-choice question
Regarding Norm properties, about permutations in Genome Rearrangements, which of the following properties is NOT true:
a - ||α|| = 0 if and only if α = 1
b - ||αβ|| ≤ ||α|| + ||β||
c - ||αβ|| = ||βα||
d - ||α|| = |E| - |orb(α)|
e - None of above
a - ||α|| = 0 if and only if α = 1
b - ||αβ|| ≤ ||α|| + ||β||
c - ||αβ|| = ||βα||
d - ||α|| = |E| - |orb(α)|
e - None of above
sexta-feira, 24 de abril de 2015
MO640 - Multiple-choice question
Which of the following evolution events can be modeled by one or more applications operating double-cut-and-join?
I - Translocation
II - Reversal
III - Blocks Exchange
I - Translocation
II - Reversal
III - Blocks Exchange
- Only I e II.
- Only I e III.
- Only II e III.
- I, II e III.
- None of the above
Original idea by: João Paulo Pereira Zanetti
sexta-feira, 10 de abril de 2015
MO640 - Multiple-choice question
Given a genome represented by the following unoriented blocks(1 -5 2 6 4 -3 -8 7). Suppose that only a single reversal operation is performed in the genome. Which of the following alternatives would NOT be the result of this one reversal operation?
(1 -5 2 6 4 -3 -8 7).
a - (1 -2 5 6 4 -3 -8 7)
b - (1 -5 2 6 4 -3 -8 -7)
c - (1 -5 -4 -6 -2 -3 -8 7)
d- (1 -5 2 3 -4 -6 -8 7)
e - None of the above.
(1 -5 2 6 4 -3 -8 7).
a - (1 -2 5 6 4 -3 -8 7)
b - (1 -5 2 6 4 -3 -8 -7)
c - (1 -5 -4 -6 -2 -3 -8 7)
d- (1 -5 2 3 -4 -6 -8 7)
e - None of the above.
quarta-feira, 1 de abril de 2015
MO640 - Multiple-choice question
What is the best phylogeny for the following matrix of states of characteristics?
Characteristics | ||||||
individual | c1 | c2 | c3 | c4 | c5 | c6 |
A | 0 | 0 | 0 | 1 | 1 | 0 |
B | 1 | 1 | 0 | 0 | 0 | 0 |
C | 0 | 0 | 0 | 1 | 1 | 1 |
D | 1 | 0 | 1 | 0 | 0 | 0 |
E | 0 | 0 | 0 | 1 | 0 | 0 |
- None of the above
Original idea by: Felipe Holanda
quinta-feira, 26 de março de 2015
MO640 - Multiple-choice question
Which of the alternatives below is seen as a disadvantage of using the distance as a criterion for linearity between genetic structures?
a) The distance takes into account recombination and only certain types of mutations, such as insertions and deletions
b) The distance takes account only the changes, leaving aside recombinations
c) The distance takes account insertions but ignores deletions
d) The distance is not always strictly additive
e. None of the above
Original idea by: Priscila Nascimento Biller
a) The distance takes into account recombination and only certain types of mutations, such as insertions and deletions
b) The distance takes account only the changes, leaving aside recombinations
c) The distance takes account insertions but ignores deletions
d) The distance is not always strictly additive
e. None of the above
Original idea by: Priscila Nascimento Biller
sexta-feira, 13 de março de 2015
Given two algorithms A and B to solve a problem. Given a input of size N ∈
.
The algorithm A takes time f(N)=N².
The algorithm B takes g(N)=aN, where a is a constant, for any size of N.
We can conclude that:
a) The A algorithm will always be faster than B because A is quadratic, regardless the size of N.
b) The B algorithm will always be faster than A because B is linear, regardless the size of N.
c) When the size of N is smaller than a, the quadratic algorithm will be faster.
d) When the size of N is larger than a, the quadratic algorithm will be faster.
e) NOTA
Original idea by Rodrigo Ritter.

The algorithm A takes time f(N)=N².
The algorithm B takes g(N)=aN, where a is a constant, for any size of N.
We can conclude that:
a) The A algorithm will always be faster than B because A is quadratic, regardless the size of N.
b) The B algorithm will always be faster than A because B is linear, regardless the size of N.
c) When the size of N is smaller than a, the quadratic algorithm will be faster.
d) When the size of N is larger than a, the quadratic algorithm will be faster.
e) NOTA
Original idea by Rodrigo Ritter.
Assinar:
Postagens (Atom)