In the genome rearrangement there always is a DCJ operation which reduce the difference between the number of breakpoints and the number of cycles by one unit, except when the genome have been ordered. Others features of this problem are:
a) The DCJ operation can't increase (b - c).
b) The DCJ operation always increase the number of cycles.
c) The DCJ operation always reduce the number of breakpoints.
d) The genomic distance, considering the DCJ operation, is equal of (b - c).
e) None of above.
Original idea by: Fabio L. Usberti
Translation help by: Andrey Victor Justo
quinta-feira, 23 de abril de 2015
quinta-feira, 16 de abril de 2015
Week 7 (Single-Cut-or-Join)
Consider the statements below and choose the right answer about SCJ:
I - SCJ is a new way to compute the distance between two genomes that can be used to solve the MGRP (multiple genome rearrangement problem).
II - SCJ is NP-hard.
III - For SCJ problem have been provided linear and polinomial time algoritms.
a) I.
b) I and III.
c) II
d) I and II.
e) None of Above.
Original idea by: Andrey Victor Justo
I - SCJ is a new way to compute the distance between two genomes that can be used to solve the MGRP (multiple genome rearrangement problem).
II - SCJ is NP-hard.
III - For SCJ problem have been provided linear and polinomial time algoritms.
a) I.
b) I and III.
c) II
d) I and II.
e) None of Above.
Original idea by: Andrey Victor Justo
quinta-feira, 9 de abril de 2015
Week 6 (Genome Rearreagements)
Choose the WRONG alternative about genome rearreagements:
a) Rearreagements events represents the changing of segments of the genome.
b) Segments of the genome can be exchanged between the strips of the DNA.
c) There isn't a rearreagement event that change the number of genes in the genome.
d) The genome can be broke in two or more smaller genomes.
e) None of Above.
Original idea by: Leonardo Elias Mariote
Translation help by: Andrey Victor Justo
a) Rearreagements events represents the changing of segments of the genome.
b) Segments of the genome can be exchanged between the strips of the DNA.
c) There isn't a rearreagement event that change the number of genes in the genome.
d) The genome can be broke in two or more smaller genomes.
e) None of Above.
Original idea by: Leonardo Elias Mariote
Translation help by: Andrey Victor Justo
sexta-feira, 3 de abril de 2015
Week 5 (Phylogeny Problems)
The Parsimony methods have been used to build phylogenic trees and they have one of the objectives below:
a) Search for a phylogeny that has the lowest number of outgroups among the species analyzed.
b) Search for a phylogeny that has the greatest possible number of species in the tree leaves, i.e., species that aren't ancestors.
c) Search for phylogenetic tree that does't have a root.
d) Search phylogeny that has the lowest possible number of homoplasies.
e) None of above.
Original idea by: Mirela Dal Col Silva
Translation help by: Andrey Victor Justo
a) Search for a phylogeny that has the lowest number of outgroups among the species analyzed.
b) Search for a phylogeny that has the greatest possible number of species in the tree leaves, i.e., species that aren't ancestors.
c) Search for phylogenetic tree that does't have a root.
d) Search phylogeny that has the lowest possible number of homoplasies.
e) None of above.
Original idea by: Mirela Dal Col Silva
Translation help by: Andrey Victor Justo
Assinar:
Postagens (Atom)