What can be assert about permutation group theory:

a) - It is another way to describe DCJ.
b) - It differs from DCJ only in linear fissions.
c) - It is not the same of DCJ, but it is very similar to.
d) - It is not like DCJ, but is equal to SCJ method.
e) - none of the above

Original idea by: Guilherme de Mello Barsoti

Regarding to genome rearrangement, which alternative is correct:

a) - SCJ only can solve several rearrangement genome problems in exponential time
b) - One genome needs to have at least two adjacencies to be used at SCJ method
c) - Fitch's algorithm consider adjacencies as binary character
d) - Adjacencies are always seen as binary characters under SCJ method 
e) - none of the above

Original idea by: Guilherme de Mello Barsoti

Regarding to building perfect phylogeny, which alternative is correct:

a) - Is not possible to build a perfect phylogeny without a root
b) - If the characteristics in a character state matrix are not binary, build a perfect phylogeny is trivial
c) - In a perfect phylogeny, a event to a characteristics cannot appear twice in the tree 
d) - Character state matrices are always square matrices 
e) - none of the above

Original idea by: Guilherme de Mello Barsoti

Regarding to phylogenies theory, which alternative is correct:

a) - BPP is a trivial problem that is normally solved with low processing
b) - SPP has the characteristic of find a phylogenies with minimum evolution
c) - The lost or gain of a specific characteristic can happen just once in the evolution
d) - There are two ways to root a tree: by outgroup or by molecular clock
e) - none of the above

Original idea by: Guilherme de Mello Barsoti

How an alignment scoring system needs to be defined?

a) - Match: needs to be positive ; Mismatch: needs to be positive ; Space: needs to be negative
b) - Match: needs to be positive ; Mismatch: needs to be positive or zero ; Space: needs to be negative
c) - Match: are higher than mismatches ; Mismatch: are higher than spaces ; Space: are lower than mismatches
d) - Match: are lower than mismatches ; Mismatch: needs to be positive ; Space: are negative numbers
e) - none of the above

Original idea by: Guilherme de Mello Barsoti

Regarding to data structures, what is a leaf node in a tree?

a) - It is the main node
b) - It is the first node 
c) - It is a node that does not have descendants
d) - It is a node that does not have ancestors
e) - none of the above

Original idea by: Guilherme de Mello Barsoti

1 - Which nucleic acid is not used on protein synthesis?

a) - DNA
b) - Junk DNA
c) - mRNA
d) - tRNA
e) - none of the above

Original idea by: Guilherme de Mello Barsoti