terça-feira, 9 de junho de 2015

Week's question

Let C = { abcd, bcdef, afghijk, bcdgh, ghijk }. Choose the alternative that contains all the sets of twins from C:

1) abc, gh, ijk
2) bcd, ef, hij
3) bcd, gh, ghi
4) bcd, gh, ijk
5) None of the above

Author: Victor de Abreu Iizuka
Translated by: Rafael S. Padilha

terça-feira, 2 de junho de 2015

PQ-Tree


Which of the affirmatives bellow are true about the Booth and Lueker's algorithm to build a PQ-tree:

I - The algorithm has two steps, one to identify the nodes that must be processed and another to apply the reductions.
II - Every son of a Q node has pointers to his fathers
III - The linear complexity is confirmed by doing an amortized analysis

A. I and II
B. I and III
C. II
D. III
E. None of the above

Author: Maria Angélica Lopes de Souza

Translated by: Rafael Soares Padilha

quinta-feira, 28 de maio de 2015

Benzer's estimate

What is the approximate Benzer's estimate of the probability that a random 15x15 symmetric matrix can be arranged in dictionary order?

1) 1.28 * 10^(-4)
2) 3.07 * 10^(-6)
3) 4.22 * 10^(-8)
4) 3.29 * 10^(-10)
5) None of the above


Author: Rafael Soares Padilha

quinta-feira, 21 de maio de 2015

Block Interchange

What is the minimum number of block interchange operations to order the following sequence?

(3 1 4 6 2 5)


A) 2 operations
B) 3 operations
C) 4 operations
D) 5 operations
E) None of the above

sexta-feira, 15 de maio de 2015

Ordered Pairs

How many ordered pairs are there in the following genome?

(0 -5 -6 -1 -3 -2 4 7)
  1. 0
  2. 2
  3. 4
  4. 8
  5. None of the above

Author: Felipe Holanda
Translated by : Rafael S. Padilha

sexta-feira, 8 de maio de 2015

Permutation Question

Which of the permutations bellow divides the following permutation: (a g d f e h)(b c)(k i j l)  ?
  1. (a b k) 
  2. (d h a g) 
  3. (i l j) 
  4. (a b c) 
  5. None of the alternatives 

Author: Andrey Seiji Shimada
Translated by: Rafael S. Padilha

quarta-feira, 29 de abril de 2015

Week's Question

Considering α = (a b), β = (a b c d) e γ = (a c)(b d), chose the FALSE alternative:
  1. αγ = (a c d b); 
  2. αβ = (a)(b c d); 
  3. βα = (a c d)(b); 
  4. γα = (a d b c); 
  5. NDA 
Author: Moacy Barros Correia da Silva
Translated by : Rafael S. Padilha

sexta-feira, 24 de abril de 2015

DCJ question

Which of the evolution events bellow can be modeled by using one or more double-cut-and-join operations?

I - Translocation
II - Reversal
III - Block interchange
  1. I, II and III. 
  2. I and II. 
  3. I and III. 
  4. II and III. 
  5. None of the above
Author: João Paulo Pereira Zanetti
Translation: Rafael Soares Padilha

terça-feira, 14 de abril de 2015

Question about SCJ Distance



Given the two genomes bellow, what is their SCJ distance?




A)  10
B)  12
C)  8
D)  14
E) None of the above

Idea: Rafael S. Padilha
Image from here

quinta-feira, 9 de abril de 2015

Adjencie Set

Given the fictitious genome bellow, comprising two linear chromosomes, determine its adjencie set:













A) { ND3h ND4Lt, ND4Lh ND4t, ND4h ND5t, ND5h ND6h, 16Sh ND1t, ND1h ND2t }

B) { ND3t ND4Lh, ND4Lt ND4h, ND4t ND5h, ND5t ND6t, 16St ND1h, ND1t ND2h }

C) { ND3h ND4Lt, ND4Lh ND4t, ND4h ND5t, ND5h ND6h, ND6t 16St, 16Sh ND1t, ND1h ND2t }

D) { ND3t ND4Lh, ND4Lt ND4h, ND4t ND5h, ND5t ND6t, ND6h 16Sh, 16St ND1h, ND1t ND2h }

E) None of the above

quinta-feira, 2 de abril de 2015

Phylogeny question

What is the best phylogeny tree for the characteristic's table bellow:

Characteristics
Personc1c2c3c4c5c6
A000110
B110000
C000111
D101000
E000100
(Consider that a named edge means that the characteristic changed)

a) 


b)


c)


d)


e) None of the above

Author: Felipe Holanda
Translated by: Rafael Padilha

sexta-feira, 20 de março de 2015

Question 3

The final outcome of the DNA transcription is called:
1) Messenger RNA
2) Polymerase RNA
3) Ribosomal RNA
4) Transfer RNA
5) None of the above

Author: Fabio L. Usberti
Translated by: Rafael Padilha

quinta-feira, 12 de março de 2015

Question 02

Which of bellow sentences is correct?
1)  Both problems of (A) finding a Hamiltonian Cycle and (B) finding a Eulerian Cycle belongs to the NP - Complete class of problems.
2)  There aren't graphs that accept both a hamiltonian cycle and a eulerian cycle simultaneously.
3)  Eulerian and Hamiltonian graphs are necessarily connected graphs.
4)  The Travelling Salesman Problem (TSP) is a particular case of the problem of finding a eulerian cycle.
5)  NDA

Author: Roberto Hiroshi Higa
Translated by: Rafael S. Padilha

quinta-feira, 5 de março de 2015

Question 01

MO640 - Question for the multiple choice test

What is the alternative that best defines Bioinformatic?
1) Informatization of data collected in biological experiments
2) Study of computer tools applied to Biology
3) Study of the biological behavior of computing professionals
4) Analisys and modeling of Biology problems in order to obtain computacional solutions
5) None of the above

Author: Fernando Ferrari de Goes
Translated by: Rafael Soares Padilha