According to the model of DNA sequence evolution described by Kimura,
in the equation X(t) + Y(t) + 2 * Z(t) = 1, which sentence bellow is CORRECT?
a. Y(t) is the transition probability.
b. X(t) is the transversion probability.
c. Y(t) + 2 * Z(t) is the probability of having no changes.
d. The constant 2 is to consider the two different transition types (i.e., A<->G; C<->T).
e. None of the above.
Translated by: Raphael Cristofaro
Original idea by: Helder dos Santos Ribeiro
sexta-feira, 27 de março de 2015
sexta-feira, 20 de março de 2015
Week 3 - Sequence comparison
Which of the following statements is CORRECT?
a) Local alignments are most useful when the query set has similar sequences, it attempts to align every residue in those sequences.
b) Global alignments identify regions of similarity within long sequences that are often widely divergent overall.
c) Dynamic programming methods like the Needleman-Wunsch and the Smith-Waterman algorithms are the most useful to perform large-scale database searches.
d) Unlike dynamic programming methods, k-tuple methods like FASTA and BLAST are heuristics that guarantee to find an optimal alignment solution.
e) None of the above.
Original idea by: Raphael Cristofaro
a) Local alignments are most useful when the query set has similar sequences, it attempts to align every residue in those sequences.
b) Global alignments identify regions of similarity within long sequences that are often widely divergent overall.
c) Dynamic programming methods like the Needleman-Wunsch and the Smith-Waterman algorithms are the most useful to perform large-scale database searches.
d) Unlike dynamic programming methods, k-tuple methods like FASTA and BLAST are heuristics that guarantee to find an optimal alignment solution.
e) None of the above.
Original idea by: Raphael Cristofaro
quinta-feira, 12 de março de 2015
Week 2 - Informatics Concepts
Consider the following graph properties and sign which statements are TRUE:
I - A Hamiltonian cycle can be converted to a Hamiltonian path by removing one of its edges.
II - A connected graph in which a vertex has odd degree can have an Eulerian cycle.
III - A cycle graph (a graph that consists of a single Eulerian and Hamiltonian cycle) that has an even number of vertices is bipartite.
a. I, II
b. I, III
c. II, III
d. AotA
e. NotA
Original idea by: Raphael Cristofaro
I - A Hamiltonian cycle can be converted to a Hamiltonian path by removing one of its edges.
II - A connected graph in which a vertex has odd degree can have an Eulerian cycle.
III - A cycle graph (a graph that consists of a single Eulerian and Hamiltonian cycle) that has an even number of vertices is bipartite.
a. I, II
b. I, III
c. II, III
d. AotA
e. NotA
Original idea by: Raphael Cristofaro
Assinar:
Postagens (Atom)