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